37.77/25.84 YES 37.77/25.84 37.77/25.84 Ultimate: Cannot open display: 37.77/25.84 This is Ultimate 0.1.24-8dc7c08-m 37.77/25.84 [2019-03-28 12:39:45,968 INFO L170 SettingsManager]: Resetting all preferences to default values... 37.77/25.84 [2019-03-28 12:39:45,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 37.77/25.84 [2019-03-28 12:39:45,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:45,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 37.77/25.84 [2019-03-28 12:39:45,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 37.77/25.84 [2019-03-28 12:39:45,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 37.77/25.84 [2019-03-28 12:39:45,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 37.77/25.84 [2019-03-28 12:39:45,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 37.77/25.84 [2019-03-28 12:39:45,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 37.77/25.84 [2019-03-28 12:39:45,988 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:45,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 37.77/25.84 [2019-03-28 12:39:45,990 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 37.77/25.84 [2019-03-28 12:39:45,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 37.77/25.84 [2019-03-28 12:39:45,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 37.77/25.84 [2019-03-28 12:39:45,992 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 37.77/25.84 [2019-03-28 12:39:45,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 37.77/25.84 [2019-03-28 12:39:45,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 37.77/25.84 [2019-03-28 12:39:45,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 37.77/25.84 [2019-03-28 12:39:45,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 37.77/25.84 [2019-03-28 12:39:45,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 37.77/25.84 [2019-03-28 12:39:46,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 37.77/25.84 [2019-03-28 12:39:46,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:46,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:46,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 37.77/25.84 [2019-03-28 12:39:46,004 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 37.77/25.84 [2019-03-28 12:39:46,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 37.77/25.84 [2019-03-28 12:39:46,005 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:46,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 37.77/25.84 [2019-03-28 12:39:46,006 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 37.77/25.84 [2019-03-28 12:39:46,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 37.77/25.84 [2019-03-28 12:39:46,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 37.77/25.84 [2019-03-28 12:39:46,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:46,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 37.77/25.84 [2019-03-28 12:39:46,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:46,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 37.77/25.84 [2019-03-28 12:39:46,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 37.77/25.84 [2019-03-28 12:39:46,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 37.77/25.84 [2019-03-28 12:39:46,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 37.77/25.84 [2019-03-28 12:39:46,011 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 37.77/25.84 [2019-03-28 12:39:46,026 INFO L110 SettingsManager]: Loading preferences was successful 37.77/25.84 [2019-03-28 12:39:46,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 37.77/25.84 [2019-03-28 12:39:46,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 37.77/25.84 [2019-03-28 12:39:46,028 INFO L133 SettingsManager]: * Rewrite not-equals=true 37.77/25.84 [2019-03-28 12:39:46,028 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 37.77/25.84 [2019-03-28 12:39:46,028 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 37.77/25.84 [2019-03-28 12:39:46,028 INFO L133 SettingsManager]: * Use SBE=true 37.77/25.84 [2019-03-28 12:39:46,028 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 37.77/25.84 [2019-03-28 12:39:46,028 INFO L133 SettingsManager]: * Use old map elimination=false 37.77/25.84 [2019-03-28 12:39:46,029 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 37.77/25.84 [2019-03-28 12:39:46,029 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 37.77/25.84 [2019-03-28 12:39:46,029 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 37.77/25.84 [2019-03-28 12:39:46,029 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 37.77/25.84 [2019-03-28 12:39:46,029 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 37.77/25.84 [2019-03-28 12:39:46,029 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 37.77/25.84 [2019-03-28 12:39:46,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 37.77/25.84 [2019-03-28 12:39:46,030 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 37.77/25.84 [2019-03-28 12:39:46,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE 37.77/25.84 [2019-03-28 12:39:46,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 37.77/25.84 [2019-03-28 12:39:46,030 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 37.77/25.84 [2019-03-28 12:39:46,031 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 37.77/25.84 [2019-03-28 12:39:46,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 37.77/25.84 [2019-03-28 12:39:46,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 37.77/25.84 [2019-03-28 12:39:46,031 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 37.77/25.84 [2019-03-28 12:39:46,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 37.77/25.84 [2019-03-28 12:39:46,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 37.77/25.84 [2019-03-28 12:39:46,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 37.77/25.84 [2019-03-28 12:39:46,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 37.77/25.84 [2019-03-28 12:39:46,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 37.77/25.84 [2019-03-28 12:39:46,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 37.77/25.84 [2019-03-28 12:39:46,072 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 37.77/25.84 [2019-03-28 12:39:46,075 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 37.77/25.84 [2019-03-28 12:39:46,077 INFO L271 PluginConnector]: Initializing CDTParser... 37.77/25.84 [2019-03-28 12:39:46,077 INFO L276 PluginConnector]: CDTParser initialized 37.77/25.84 [2019-03-28 12:39:46,078 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 37.77/25.84 [2019-03-28 12:39:46,139 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c69ad17c6c6f4dd0adf96bf51a17e89f/FLAG4663e8a2d 37.77/25.84 [2019-03-28 12:39:46,597 INFO L307 CDTParser]: Found 1 translation units. 37.77/25.84 [2019-03-28 12:39:46,597 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 37.77/25.84 [2019-03-28 12:39:46,598 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 37.77/25.84 [2019-03-28 12:39:46,604 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c69ad17c6c6f4dd0adf96bf51a17e89f/FLAG4663e8a2d 37.77/25.84 [2019-03-28 12:39:47,009 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c69ad17c6c6f4dd0adf96bf51a17e89f 37.77/25.84 [2019-03-28 12:39:47,020 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 37.77/25.84 [2019-03-28 12:39:47,022 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 37.77/25.84 [2019-03-28 12:39:47,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 37.77/25.84 [2019-03-28 12:39:47,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 37.77/25.84 [2019-03-28 12:39:47,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 37.77/25.84 [2019-03-28 12:39:47,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9cf8ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47, skipping insertion in model container 37.77/25.84 [2019-03-28 12:39:47,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 37.77/25.84 [2019-03-28 12:39:47,056 INFO L176 MainTranslator]: Built tables and reachable declarations 37.77/25.84 [2019-03-28 12:39:47,218 INFO L206 PostProcessor]: Analyzing one entry point: main 37.77/25.84 [2019-03-28 12:39:47,230 INFO L191 MainTranslator]: Completed pre-run 37.77/25.84 [2019-03-28 12:39:47,247 INFO L206 PostProcessor]: Analyzing one entry point: main 37.77/25.84 [2019-03-28 12:39:47,319 INFO L195 MainTranslator]: Completed translation 37.77/25.84 [2019-03-28 12:39:47,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47 WrapperNode 37.77/25.84 [2019-03-28 12:39:47,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 37.77/25.84 [2019-03-28 12:39:47,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 37.77/25.84 [2019-03-28 12:39:47,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 37.77/25.84 [2019-03-28 12:39:47,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 37.77/25.84 [2019-03-28 12:39:47,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 37.77/25.84 [2019-03-28 12:39:47,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 37.77/25.84 [2019-03-28 12:39:47,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 37.77/25.84 [2019-03-28 12:39:47,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized 37.77/25.84 [2019-03-28 12:39:47,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 37.77/25.84 [2019-03-28 12:39:47,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 37.77/25.84 [2019-03-28 12:39:47,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... 37.77/25.84 [2019-03-28 12:39:47,386 INFO L276 PluginConnector]: RCFGBuilder initialized 37.77/25.84 [2019-03-28 12:39:47,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (1/1) ... 37.77/25.84 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 37.77/25.84 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 37.77/25.84 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 37.77/25.84 [2019-03-28 12:39:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 37.77/25.84 [2019-03-28 12:39:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 37.77/25.84 [2019-03-28 12:39:47,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 37.77/25.84 [2019-03-28 12:39:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 37.77/25.84 [2019-03-28 12:39:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 37.77/25.84 [2019-03-28 12:39:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 37.77/25.84 [2019-03-28 12:39:47,700 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 37.77/25.84 [2019-03-28 12:39:47,700 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 37.77/25.84 [2019-03-28 12:39:47,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:47 BoogieIcfgContainer 37.77/25.84 [2019-03-28 12:39:47,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 37.77/25.84 [2019-03-28 12:39:47,702 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 37.77/25.84 [2019-03-28 12:39:47,702 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 37.77/25.84 [2019-03-28 12:39:47,704 INFO L276 PluginConnector]: BlockEncodingV2 initialized 37.77/25.84 [2019-03-28 12:39:47,705 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:47" (1/1) ... 37.77/25.84 [2019-03-28 12:39:47,722 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges 37.77/25.84 [2019-03-28 12:39:47,723 INFO L258 BlockEncoder]: Using Remove infeasible edges 37.77/25.84 [2019-03-28 12:39:47,724 INFO L263 BlockEncoder]: Using Maximize final states 37.77/25.84 [2019-03-28 12:39:47,725 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 37.77/25.84 [2019-03-28 12:39:47,725 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 37.77/25.84 [2019-03-28 12:39:47,727 INFO L296 BlockEncoder]: Using Remove sink states 37.77/25.84 [2019-03-28 12:39:47,728 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 37.77/25.84 [2019-03-28 12:39:47,728 INFO L179 BlockEncoder]: Using Rewrite not-equals 37.77/25.84 [2019-03-28 12:39:47,752 INFO L185 BlockEncoder]: Using Use SBE 37.77/25.84 [2019-03-28 12:39:47,792 INFO L200 BlockEncoder]: SBE split 21 edges 37.77/25.84 [2019-03-28 12:39:47,797 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 37.77/25.84 [2019-03-28 12:39:47,799 INFO L71 MaximizeFinalStates]: 0 new accepting states 37.77/25.84 [2019-03-28 12:39:47,837 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 37.77/25.84 [2019-03-28 12:39:47,841 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 37.77/25.84 [2019-03-28 12:39:47,843 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 37.77/25.84 [2019-03-28 12:39:47,843 INFO L71 MaximizeFinalStates]: 0 new accepting states 37.77/25.84 [2019-03-28 12:39:47,844 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 37.77/25.84 [2019-03-28 12:39:47,844 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 37.77/25.84 [2019-03-28 12:39:47,845 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges 37.77/25.84 [2019-03-28 12:39:47,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:47 BasicIcfg 37.77/25.84 [2019-03-28 12:39:47,845 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 37.77/25.84 [2019-03-28 12:39:47,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 37.77/25.84 [2019-03-28 12:39:47,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... 37.77/25.84 [2019-03-28 12:39:47,850 INFO L276 PluginConnector]: TraceAbstraction initialized 37.77/25.84 [2019-03-28 12:39:47,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:39:47" (1/4) ... 37.77/25.84 [2019-03-28 12:39:47,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150bdc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:47, skipping insertion in model container 37.77/25.84 [2019-03-28 12:39:47,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (2/4) ... 37.77/25.84 [2019-03-28 12:39:47,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150bdc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:39:47, skipping insertion in model container 37.77/25.84 [2019-03-28 12:39:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:47" (3/4) ... 37.77/25.84 [2019-03-28 12:39:47,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150bdc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:47, skipping insertion in model container 37.77/25.84 [2019-03-28 12:39:47,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:47" (4/4) ... 37.77/25.84 [2019-03-28 12:39:47,854 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 37.77/25.84 [2019-03-28 12:39:47,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 37.77/25.84 [2019-03-28 12:39:47,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 37.77/25.84 [2019-03-28 12:39:47,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 37.77/25.84 [2019-03-28 12:39:47,918 INFO L133 ementStrategyFactory]: Using default assertion order modulation 37.77/25.84 [2019-03-28 12:39:47,919 INFO L382 AbstractCegarLoop]: Interprodecural is true 37.77/25.84 [2019-03-28 12:39:47,919 INFO L383 AbstractCegarLoop]: Hoare is true 37.77/25.84 [2019-03-28 12:39:47,919 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 37.77/25.84 [2019-03-28 12:39:47,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 37.77/25.84 [2019-03-28 12:39:47,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 37.77/25.84 [2019-03-28 12:39:47,920 INFO L387 AbstractCegarLoop]: Difference is false 37.77/25.84 [2019-03-28 12:39:47,920 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 37.77/25.84 [2019-03-28 12:39:47,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 37.77/25.84 [2019-03-28 12:39:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. 37.77/25.84 [2019-03-28 12:39:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 37.77/25.84 [2019-03-28 12:39:47,942 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:47,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 37.77/25.85 [2019-03-28 12:39:47,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash 111352, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:47,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:47,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:48,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:48,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:48,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,159 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:48,319 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. 37.77/25.85 [2019-03-28 12:39:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 37.77/25.85 [2019-03-28 12:39:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:48,336 INFO L225 Difference]: With dead ends: 33 37.77/25.85 [2019-03-28 12:39:48,337 INFO L226 Difference]: Without dead ends: 31 37.77/25.85 [2019-03-28 12:39:48,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 37.77/25.85 [2019-03-28 12:39:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 37.77/25.85 [2019-03-28 12:39:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 37.77/25.85 [2019-03-28 12:39:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 56 transitions. 37.77/25.85 [2019-03-28 12:39:48,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 56 transitions. Word has length 3 37.77/25.85 [2019-03-28 12:39:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:48,381 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 56 transitions. 37.77/25.85 [2019-03-28 12:39:48,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. 37.77/25.85 [2019-03-28 12:39:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 37.77/25.85 [2019-03-28 12:39:48,382 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:48,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 37.77/25.85 [2019-03-28 12:39:48,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 111354, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:48,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:48,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:48,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:48,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,413 INFO L87 Difference]: Start difference. First operand 31 states and 56 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:48,501 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. 37.77/25.85 [2019-03-28 12:39:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 37.77/25.85 [2019-03-28 12:39:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:48,503 INFO L225 Difference]: With dead ends: 33 37.77/25.85 [2019-03-28 12:39:48,503 INFO L226 Difference]: Without dead ends: 31 37.77/25.85 [2019-03-28 12:39:48,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 37.77/25.85 [2019-03-28 12:39:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 37.77/25.85 [2019-03-28 12:39:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 37.77/25.85 [2019-03-28 12:39:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. 37.77/25.85 [2019-03-28 12:39:48,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 3 37.77/25.85 [2019-03-28 12:39:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:48,510 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. 37.77/25.85 [2019-03-28 12:39:48,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. 37.77/25.85 [2019-03-28 12:39:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 37.77/25.85 [2019-03-28 12:39:48,511 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:48,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 37.77/25.85 [2019-03-28 12:39:48,511 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:48,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:48,511 INFO L82 PathProgramCache]: Analyzing trace with hash 111355, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:48,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:48,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:48,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:48,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,552 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:48,661 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. 37.77/25.85 [2019-03-28 12:39:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 37.77/25.85 [2019-03-28 12:39:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:48,662 INFO L225 Difference]: With dead ends: 31 37.77/25.85 [2019-03-28 12:39:48,662 INFO L226 Difference]: Without dead ends: 29 37.77/25.85 [2019-03-28 12:39:48,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 37.77/25.85 [2019-03-28 12:39:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 37.77/25.85 [2019-03-28 12:39:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 37.77/25.85 [2019-03-28 12:39:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. 37.77/25.85 [2019-03-28 12:39:48,667 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 3 37.77/25.85 [2019-03-28 12:39:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:48,668 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 52 transitions. 37.77/25.85 [2019-03-28 12:39:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 52 transitions. 37.77/25.85 [2019-03-28 12:39:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 37.77/25.85 [2019-03-28 12:39:48,668 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:48,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:48,669 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash 3449963, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:48,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:48,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:48,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:48,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,711 INFO L87 Difference]: Start difference. First operand 29 states and 52 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:48,798 INFO L93 Difference]: Finished difference Result 29 states and 52 transitions. 37.77/25.85 [2019-03-28 12:39:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 37.77/25.85 [2019-03-28 12:39:48,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:48,800 INFO L225 Difference]: With dead ends: 29 37.77/25.85 [2019-03-28 12:39:48,800 INFO L226 Difference]: Without dead ends: 25 37.77/25.85 [2019-03-28 12:39:48,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 37.77/25.85 [2019-03-28 12:39:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 37.77/25.85 [2019-03-28 12:39:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 37.77/25.85 [2019-03-28 12:39:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. 37.77/25.85 [2019-03-28 12:39:48,805 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 4 37.77/25.85 [2019-03-28 12:39:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:48,805 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. 37.77/25.85 [2019-03-28 12:39:48,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. 37.77/25.85 [2019-03-28 12:39:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 37.77/25.85 [2019-03-28 12:39:48,806 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:48,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:48,806 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash 3449965, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:48,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:48,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:48,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:48,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:48,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:48,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,845 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:48,928 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. 37.77/25.85 [2019-03-28 12:39:48,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 37.77/25.85 [2019-03-28 12:39:48,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:48,930 INFO L225 Difference]: With dead ends: 29 37.77/25.85 [2019-03-28 12:39:48,930 INFO L226 Difference]: Without dead ends: 25 37.77/25.85 [2019-03-28 12:39:48,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 37.77/25.85 [2019-03-28 12:39:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 37.77/25.85 [2019-03-28 12:39:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 37.77/25.85 [2019-03-28 12:39:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. 37.77/25.85 [2019-03-28 12:39:48,934 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 4 37.77/25.85 [2019-03-28 12:39:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:48,934 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. 37.77/25.85 [2019-03-28 12:39:48,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. 37.77/25.85 [2019-03-28 12:39:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 37.77/25.85 [2019-03-28 12:39:48,935 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:48,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:48,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 3449966, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:48,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:48,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:48,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:48,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:48,982 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:49,051 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. 37.77/25.85 [2019-03-28 12:39:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 37.77/25.85 [2019-03-28 12:39:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:49,052 INFO L225 Difference]: With dead ends: 25 37.77/25.85 [2019-03-28 12:39:49,053 INFO L226 Difference]: Without dead ends: 21 37.77/25.85 [2019-03-28 12:39:49,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 37.77/25.85 [2019-03-28 12:39:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 37.77/25.85 [2019-03-28 12:39:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 37.77/25.85 [2019-03-28 12:39:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 37.77/25.85 [2019-03-28 12:39:49,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 37.77/25.85 [2019-03-28 12:39:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:49,057 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 37.77/25.85 [2019-03-28 12:39:49,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 37.77/25.85 [2019-03-28 12:39:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 37.77/25.85 [2019-03-28 12:39:49,058 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:49,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,058 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 106947311, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:49,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:49,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:49,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:49,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:49,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,093 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:49,147 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 37.77/25.85 [2019-03-28 12:39:49,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 37.77/25.85 [2019-03-28 12:39:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:49,149 INFO L225 Difference]: With dead ends: 21 37.77/25.85 [2019-03-28 12:39:49,149 INFO L226 Difference]: Without dead ends: 17 37.77/25.85 [2019-03-28 12:39:49,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 37.77/25.85 [2019-03-28 12:39:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 37.77/25.85 [2019-03-28 12:39:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 37.77/25.85 [2019-03-28 12:39:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 37.77/25.85 [2019-03-28 12:39:49,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 37.77/25.85 [2019-03-28 12:39:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:49,153 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 37.77/25.85 [2019-03-28 12:39:49,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 37.77/25.85 [2019-03-28 12:39:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 37.77/25.85 [2019-03-28 12:39:49,153 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:49,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash 106947313, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:49,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:49,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:49,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,178 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:49,230 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. 37.77/25.85 [2019-03-28 12:39:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 37.77/25.85 [2019-03-28 12:39:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:49,232 INFO L225 Difference]: With dead ends: 21 37.77/25.85 [2019-03-28 12:39:49,232 INFO L226 Difference]: Without dead ends: 17 37.77/25.85 [2019-03-28 12:39:49,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 37.77/25.85 [2019-03-28 12:39:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 37.77/25.85 [2019-03-28 12:39:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 37.77/25.85 [2019-03-28 12:39:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 37.77/25.85 [2019-03-28 12:39:49,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 5 37.77/25.85 [2019-03-28 12:39:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:49,236 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. 37.77/25.85 [2019-03-28 12:39:49,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. 37.77/25.85 [2019-03-28 12:39:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 37.77/25.85 [2019-03-28 12:39:49,237 INFO L394 BasicCegarLoop]: Found error trace 37.77/25.85 [2019-03-28 12:39:49,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,237 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== 37.77/25.85 [2019-03-28 12:39:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash 106947314, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:49,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:49,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:49,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 37.77/25.85 [2019-03-28 12:39:49,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 37.77/25.85 [2019-03-28 12:39:49,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 37.77/25.85 [2019-03-28 12:39:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 37.77/25.85 [2019-03-28 12:39:49,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,272 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. 37.77/25.85 [2019-03-28 12:39:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 37.77/25.85 [2019-03-28 12:39:49,312 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. 37.77/25.85 [2019-03-28 12:39:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 37.77/25.85 [2019-03-28 12:39:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 37.77/25.85 [2019-03-28 12:39:49,313 INFO L225 Difference]: With dead ends: 17 37.77/25.85 [2019-03-28 12:39:49,313 INFO L226 Difference]: Without dead ends: 0 37.77/25.85 [2019-03-28 12:39:49,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 37.77/25.85 [2019-03-28 12:39:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 37.77/25.85 [2019-03-28 12:39:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 37.77/25.85 [2019-03-28 12:39:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 37.77/25.85 [2019-03-28 12:39:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:39:49,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 37.77/25.85 [2019-03-28 12:39:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. 37.77/25.85 [2019-03-28 12:39:49,315 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:39:49,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 37.77/25.85 [2019-03-28 12:39:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:39:49,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 37.77/25.85 [2019-03-28 12:39:49,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:39:49,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,353 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,353 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,353 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,354 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,354 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,354 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,354 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,354 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,355 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 16) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 37.77/25.85 [2019-03-28 12:39:49,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,355 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 16) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,356 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,357 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,357 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,358 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,358 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 37.77/25.85 [2019-03-28 12:39:49,358 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 37.77/25.85 [2019-03-28 12:39:49,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:39:49,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:39:49,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:39:49,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:39:49,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:39:49,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:39:49,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:49 BasicIcfg 37.77/25.85 [2019-03-28 12:39:49,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 37.77/25.85 [2019-03-28 12:39:49,379 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 37.77/25.85 [2019-03-28 12:39:49,379 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 37.77/25.85 [2019-03-28 12:39:49,382 INFO L276 PluginConnector]: BuchiAutomizer initialized 37.77/25.85 [2019-03-28 12:39:49,383 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.77/25.85 [2019-03-28 12:39:49,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:39:47" (1/5) ... 37.77/25.85 [2019-03-28 12:39:49,384 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@521f029e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:49, skipping insertion in model container 37.77/25.85 [2019-03-28 12:39:49,384 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.77/25.85 [2019-03-28 12:39:49,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:39:47" (2/5) ... 37.77/25.85 [2019-03-28 12:39:49,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@521f029e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:39:49, skipping insertion in model container 37.77/25.85 [2019-03-28 12:39:49,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.77/25.85 [2019-03-28 12:39:49,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:39:47" (3/5) ... 37.77/25.85 [2019-03-28 12:39:49,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@521f029e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:49, skipping insertion in model container 37.77/25.85 [2019-03-28 12:39:49,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.77/25.85 [2019-03-28 12:39:49,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:39:47" (4/5) ... 37.77/25.85 [2019-03-28 12:39:49,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@521f029e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:39:49, skipping insertion in model container 37.77/25.85 [2019-03-28 12:39:49,386 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 37.77/25.85 [2019-03-28 12:39:49,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:39:49" (5/5) ... 37.77/25.85 [2019-03-28 12:39:49,387 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 37.77/25.85 [2019-03-28 12:39:49,409 INFO L133 ementStrategyFactory]: Using default assertion order modulation 37.77/25.85 [2019-03-28 12:39:49,409 INFO L374 BuchiCegarLoop]: Interprodecural is true 37.77/25.85 [2019-03-28 12:39:49,409 INFO L375 BuchiCegarLoop]: Hoare is true 37.77/25.85 [2019-03-28 12:39:49,409 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 37.77/25.85 [2019-03-28 12:39:49,409 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 37.77/25.85 [2019-03-28 12:39:49,409 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 37.77/25.85 [2019-03-28 12:39:49,409 INFO L379 BuchiCegarLoop]: Difference is false 37.77/25.85 [2019-03-28 12:39:49,409 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 37.77/25.85 [2019-03-28 12:39:49,410 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 37.77/25.85 [2019-03-28 12:39:49,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 37.77/25.85 [2019-03-28 12:39:49,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 37.77/25.85 [2019-03-28 12:39:49,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 37.77/25.85 [2019-03-28 12:39:49,419 INFO L119 BuchiIsEmpty]: Starting construction of run 37.77/25.85 [2019-03-28 12:39:49,423 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,423 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,424 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 37.77/25.85 [2019-03-28 12:39:49,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 37.77/25.85 [2019-03-28 12:39:49,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 37.77/25.85 [2019-03-28 12:39:49,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 37.77/25.85 [2019-03-28 12:39:49,426 INFO L119 BuchiIsEmpty]: Starting construction of run 37.77/25.85 [2019-03-28 12:39:49,427 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,427 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 37.77/25.85 [2019-03-28 12:39:49,432 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [81] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [123] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret10, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 10#L10true [57] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 23#L10-1true [74] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 28#L11true [82] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 25#L13-3true 37.77/25.85 [2019-03-28 12:39:49,433 INFO L796 eck$LassoCheckResult]: Loop: 25#L13-3true [78] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 32#L13true [87] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 30#L13-1true [86] L13-1-->L14: Formula: (<= (+ |v_ULTIMATE.start_test_fun_#t~mem3_6| 1) |v_ULTIMATE.start_test_fun_#t~mem4_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 16#L14true [66] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 15#L14-1true [165] L14-1-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (= (store |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| 1))) |v_#memory_int_17|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_17|, #length=|v_#length_26|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 18#L15true [69] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 34#L15-1true [169] L15-1-->L13-3: Formula: (and (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| 1))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 25#L13-3true 37.77/25.85 [2019-03-28 12:39:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 107155798, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:49,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash 525939443, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:49,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:49,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash 626321406, now seen corresponding path program 1 times 37.77/25.85 [2019-03-28 12:39:49,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 37.77/25.85 [2019-03-28 12:39:49,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 37.77/25.85 [2019-03-28 12:39:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 37.77/25.85 [2019-03-28 12:39:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:49,971 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 37.77/25.85 [2019-03-28 12:39:50,086 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 37.77/25.85 [2019-03-28 12:39:50,100 INFO L216 LassoAnalysis]: Preferences: 37.77/25.85 [2019-03-28 12:39:50,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 37.77/25.85 [2019-03-28 12:39:50,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 37.77/25.85 [2019-03-28 12:39:50,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 37.77/25.85 [2019-03-28 12:39:50,102 INFO L127 ssoRankerPreferences]: Use exernal solver: false 37.77/25.85 [2019-03-28 12:39:50,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 37.77/25.85 [2019-03-28 12:39:50,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 37.77/25.85 [2019-03-28 12:39:50,102 INFO L130 ssoRankerPreferences]: Path of dumped script: 37.77/25.85 [2019-03-28 12:39:50,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 37.77/25.85 [2019-03-28 12:39:50,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 37.77/25.85 [2019-03-28 12:39:50,103 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 37.77/25.85 [2019-03-28 12:39:50,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,492 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 37.77/25.85 [2019-03-28 12:39:50,622 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 37.77/25.85 [2019-03-28 12:39:50,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:50,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 37.77/25.85 [2019-03-28 12:39:51,032 INFO L300 LassoAnalysis]: Preprocessing complete. 37.77/25.85 [2019-03-28 12:39:51,038 INFO L497 LassoAnalysis]: Using template 'affine'. 37.77/25.85 [2019-03-28 12:39:51,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 37.77/25.85 [2019-03-28 12:39:51,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 37.77/25.85 [2019-03-28 12:39:51,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 37.77/25.85 [2019-03-28 12:39:51,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 37.77/25.85 Termination analysis: LINEAR_WITH_GUESSES 37.77/25.85 Number of strict supporting invariants: 0 37.77/25.85 Number of non-strict supporting invariants: 1 37.77/25.85 Consider only non-deceasing supporting invariants: true 37.77/25.85 Simplify termination arguments: true 37.77/25.85 Simplify supporting invariants: trueOverapproximate stem: false 37.77/25.85 [2019-03-28 12:39:51,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. 37.77/25.85 [2019-03-28 12:39:51,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 37.77/25.85 [2019-03-28 12:39:51,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 37.77/25.85 [2019-03-28 12:39:51,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 37.77/25.85 [2019-03-28 12:39:51,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 37.77/25.85 [2019-03-28 12:39:51,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 37.77/25.85 [2019-03-28 12:39:51,159 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 37.77/25.85 [2019-03-28 12:39:51,178 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 37.77/25.85 [2019-03-28 12:39:51,178 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 37.77/25.85 [2019-03-28 12:39:51,181 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 37.77/25.85 [2019-03-28 12:39:51,182 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 37.77/25.85 [2019-03-28 12:39:51,183 INFO L518 LassoAnalysis]: Proved termination. 37.77/25.85 [2019-03-28 12:39:51,183 INFO L520 LassoAnalysis]: Termination argument consisting of: 37.77/25.85 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 37.77/25.85 Supporting invariants [] 37.77/25.85 [2019-03-28 12:39:51,268 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 37.77/25.85 [2019-03-28 12:39:51,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 37.77/25.85 [2019-03-28 12:39:51,273 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 37.77/25.85 [2019-03-28 12:39:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 37.77/25.85 [2019-03-28 12:39:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:51,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core 37.77/25.85 [2019-03-28 12:39:51,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... 37.77/25.85 [2019-03-28 12:39:51,356 INFO L189 IndexEqualityManager]: detected not equals via solver 37.77/25.85 [2019-03-28 12:39:51,372 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 37.77/25.85 [2019-03-28 12:39:51,373 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 37.77/25.85 [2019-03-28 12:39:51,382 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 37.77/25.85 [2019-03-28 12:39:51,383 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 37.77/25.85 [2019-03-28 12:39:51,383 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 37.77/25.85 [2019-03-28 12:39:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:51,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core 37.77/25.85 [2019-03-28 12:39:51,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... 37.77/25.85 [2019-03-28 12:39:51,546 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 37.77/25.85 [2019-03-28 12:39:51,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 68 37.77/25.85 [2019-03-28 12:39:51,558 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 37.77/25.85 [2019-03-28 12:39:51,594 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 37.77/25.85 [2019-03-28 12:39:51,595 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 37.77/25.85 [2019-03-28 12:39:51,595 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 37.77/25.85 [2019-03-28 12:39:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 37.77/25.85 [2019-03-28 12:39:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:51,841 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 37.77/25.85 [2019-03-28 12:39:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:39:51,850 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 37.77/25.85 [2019-03-28 12:39:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 37.77/25.85 [2019-03-28 12:39:51,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core 37.77/25.85 [2019-03-28 12:39:51,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... 37.77/25.85 [2019-03-28 12:39:51,928 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 37.77/25.85 [2019-03-28 12:39:51,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 37.77/25.85 [2019-03-28 12:39:51,943 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 37.77/25.85 [2019-03-28 12:39:52,005 INFO L497 ElimStorePlain]: treesize reduction 85, result has 38.4 percent of original size 37.77/25.85 [2019-03-28 12:39:52,007 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 37.77/25.85 [2019-03-28 12:39:52,008 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 37.77/25.85 [2019-03-28 12:40:01,551 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 31 37.77/25.85 [2019-03-28 12:40:02,567 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 37.77/25.85 [2019-03-28 12:40:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 37.77/25.85 [2019-03-28 12:40:02,581 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 37.77/25.85 [2019-03-28 12:40:02,581 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 14 predicates after loop cannibalization 37.77/25.85 [2019-03-28 12:40:02,585 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 14 loop predicates 37.77/25.85 [2019-03-28 12:40:02,586 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states. Second operand 9 states. 37.77/25.85 [2019-03-28 12:40:08,349 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states.. Second operand 9 states. Result 144 states and 245 transitions. Complement of second has 43 states. 37.77/25.85 [2019-03-28 12:40:08,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 3 stem states 9 non-accepting loop states 2 accepting loop states 37.77/25.85 [2019-03-28 12:40:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 37.77/25.85 [2019-03-28 12:40:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. 37.77/25.85 [2019-03-28 12:40:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 7 letters. 37.77/25.85 [2019-03-28 12:40:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. 37.77/25.85 [2019-03-28 12:40:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 12 letters. Loop has 7 letters. 37.77/25.85 [2019-03-28 12:40:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. 37.77/25.85 [2019-03-28 12:40:08,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 14 letters. 37.77/25.85 [2019-03-28 12:40:08,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. 37.77/25.85 [2019-03-28 12:40:08,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 245 transitions. 37.77/25.85 [2019-03-28 12:40:08,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 37.77/25.85 [2019-03-28 12:40:08,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:40:08,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 37.77/25.85 [2019-03-28 12:40:08,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 37.77/25.85 [2019-03-28 12:40:08,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:40:08,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 37.77/25.85 [2019-03-28 12:40:08,376 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:40:08,376 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:40:08,376 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:40:08,376 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 37.77/25.85 [2019-03-28 12:40:08,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 37.77/25.85 [2019-03-28 12:40:08,377 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 37.77/25.85 [2019-03-28 12:40:08,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 37.77/25.85 [2019-03-28 12:40:08,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:08 BasicIcfg 37.77/25.85 [2019-03-28 12:40:08,383 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 37.77/25.85 [2019-03-28 12:40:08,383 INFO L168 Benchmark]: Toolchain (without parser) took 21362.46 ms. Allocated memory was 649.6 MB in the beginning and 766.0 MB in the end (delta: 116.4 MB). Free memory was 564.9 MB in the beginning and 493.6 MB in the end (delta: 71.3 MB). Peak memory consumption was 187.7 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,384 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.67 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 564.9 MB in the beginning and 640.7 MB in the end (delta: -75.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.59 ms. Allocated memory is still 673.2 MB. Free memory was 640.7 MB in the beginning and 637.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,386 INFO L168 Benchmark]: Boogie Preprocessor took 23.88 ms. Allocated memory is still 673.2 MB. Free memory was 637.6 MB in the beginning and 636.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,387 INFO L168 Benchmark]: RCFGBuilder took 315.67 ms. Allocated memory is still 673.2 MB. Free memory was 634.9 MB in the beginning and 611.3 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,387 INFO L168 Benchmark]: BlockEncodingV2 took 143.36 ms. Allocated memory is still 673.2 MB. Free memory was 611.3 MB in the beginning and 601.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,388 INFO L168 Benchmark]: TraceAbstraction took 1531.39 ms. Allocated memory is still 673.2 MB. Free memory was 600.5 MB in the beginning and 432.7 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,388 INFO L168 Benchmark]: BuchiAutomizer took 19004.13 ms. Allocated memory was 673.2 MB in the beginning and 766.0 MB in the end (delta: 92.8 MB). Free memory was 432.7 MB in the beginning and 493.6 MB in the end (delta: -60.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 37.77/25.85 [2019-03-28 12:40:08,392 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 37.77/25.85 --- Results --- 37.77/25.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 37.77/25.85 - StatisticsResult: Initial Icfg 37.77/25.85 40 locations, 41 edges 37.77/25.85 - StatisticsResult: Encoded RCFG 37.77/25.85 33 locations, 60 edges 37.77/25.85 * Results from de.uni_freiburg.informatik.ultimate.core: 37.77/25.85 - StatisticsResult: Toolchain Benchmarks 37.77/25.85 Benchmark results are: 37.77/25.85 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 37.77/25.85 * CACSL2BoogieTranslator took 296.67 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 564.9 MB in the beginning and 640.7 MB in the end (delta: -75.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 37.77/25.85 * Boogie Procedure Inliner took 41.59 ms. Allocated memory is still 673.2 MB. Free memory was 640.7 MB in the beginning and 637.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 37.77/25.85 * Boogie Preprocessor took 23.88 ms. Allocated memory is still 673.2 MB. Free memory was 637.6 MB in the beginning and 636.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 37.77/25.85 * RCFGBuilder took 315.67 ms. Allocated memory is still 673.2 MB. Free memory was 634.9 MB in the beginning and 611.3 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 37.77/25.85 * BlockEncodingV2 took 143.36 ms. Allocated memory is still 673.2 MB. Free memory was 611.3 MB in the beginning and 601.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 37.77/25.85 * TraceAbstraction took 1531.39 ms. Allocated memory is still 673.2 MB. Free memory was 600.5 MB in the beginning and 432.7 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 50.3 GB. 37.77/25.85 * BuchiAutomizer took 19004.13 ms. Allocated memory was 673.2 MB in the beginning and 766.0 MB in the end (delta: 92.8 MB). Free memory was 432.7 MB in the beginning and 493.6 MB in the end (delta: -60.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 50.3 GB. 37.77/25.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #length 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #length 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #length 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #length 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #length 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #length 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #memory_int 37.77/25.85 - GenericResult: Unfinished Backtranslation 37.77/25.85 unknown boogie variable #memory_int 37.77/25.85 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 37.77/25.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 10]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 10]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 11]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 14]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 11]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 12]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 12]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 15]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 13]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - PositiveResult [Line: 17]: pointer dereference always succeeds 37.77/25.85 For all program executions holds that pointer dereference always succeeds at this location 37.77/25.85 - AllSpecificationsHoldResult: All specifications hold 37.77/25.85 20 specifications checked. All of them hold 37.77/25.85 - InvariantResult [Line: 12]: Loop Invariant 37.77/25.85 [2019-03-28 12:40:08,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:40:08,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:40:08,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:40:08,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:40:08,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 [2019-03-28 12:40:08,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 37.77/25.85 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 37.77/25.85 - StatisticsResult: Ultimate Automizer benchmark data 37.77/25.85 CFG has 1 procedures, 33 locations, 20 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 264 SDslu, 6 SDs, 0 SdLazy, 321 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 37.77/25.85 - StatisticsResult: Constructed decomposition of program 37.77/25.85 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 14 locations. 37.77/25.85 - StatisticsResult: Timing statistics 37.77/25.85 BüchiAutomizer plugin needed 18.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 16.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 446 SDslu, 52 SDs, 0 SdLazy, 544 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital305 mio100 ax100 hnf100 lsp98 ukn60 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 37.77/25.85 - TerminationAnalysisResult: Termination proven 37.77/25.85 Buchi Automizer proved that your program is terminating 37.77/25.85 RESULT: Ultimate proved your program to be correct! 37.77/25.85 !SESSION 2019-03-28 12:39:43.651 ----------------------------------------------- 37.77/25.85 eclipse.buildId=unknown 37.77/25.85 java.version=1.8.0_181 37.77/25.85 java.vendor=Oracle Corporation 37.77/25.85 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 37.77/25.85 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 37.77/25.85 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 37.77/25.85 37.77/25.85 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:40:08.632 37.77/25.85 !MESSAGE The workspace will exit with unsaved changes in this session. 37.77/25.85 Received shutdown request... 37.77/25.85 Ultimate: 37.77/25.85 GTK+ Version Check 37.77/25.85 EOF