java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-18 09:56:12,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 09:56:12,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 09:56:12,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 09:56:12,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 09:56:12,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 09:56:12,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 09:56:12,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 09:56:12,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 09:56:12,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 09:56:12,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 09:56:12,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 09:56:12,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 09:56:12,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 09:56:12,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 09:56:12,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 09:56:12,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 09:56:12,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 09:56:12,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 09:56:12,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 09:56:12,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 09:56:12,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 09:56:12,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 09:56:12,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 09:56:12,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 09:56:12,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 09:56:12,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 09:56:12,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 09:56:12,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 09:56:12,317 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 09:56:12,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 09:56:12,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 09:56:12,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 09:56:12,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 09:56:12,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 09:56:12,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 09:56:12,321 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-18 09:56:12,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 09:56:12,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 09:56:12,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 09:56:12,350 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 09:56:12,350 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 09:56:12,350 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 09:56:12,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 09:56:12,350 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 09:56:12,351 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 09:56:12,351 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 09:56:12,351 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 09:56:12,351 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 09:56:12,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 09:56:12,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 09:56:12,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 09:56:12,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 09:56:12,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 09:56:12,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 09:56:12,353 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 09:56:12,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 09:56:12,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 09:56:12,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 09:56:12,354 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 09:56:12,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 09:56:12,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 09:56:12,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 09:56:12,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 09:56:12,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 09:56:12,357 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 09:56:12,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 09:56:12,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 09:56:12,358 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 09:56:12,358 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 09:56:12,358 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 09:56:12,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 09:56:12,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 09:56:12,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 09:56:12,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 09:56:12,436 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 09:56:12,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-09-18 09:56:12,833 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c31b327/cbc6a35c53de4e518063c43680fb9b3b/FLAG5a0ddea28 [2018-09-18 09:56:12,995 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 09:56:12,996 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-09-18 09:56:13,005 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c31b327/cbc6a35c53de4e518063c43680fb9b3b/FLAG5a0ddea28 [2018-09-18 09:56:13,022 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c31b327/cbc6a35c53de4e518063c43680fb9b3b [2018-09-18 09:56:13,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 09:56:13,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 09:56:13,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 09:56:13,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 09:56:13,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 09:56:13,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7744ec7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13, skipping insertion in model container [2018-09-18 09:56:13,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,060 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 09:56:13,313 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 09:56:13,332 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 09:56:13,347 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 09:56:13,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13 WrapperNode [2018-09-18 09:56:13,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 09:56:13,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 09:56:13,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 09:56:13,365 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 09:56:13,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 09:56:13,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 09:56:13,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 09:56:13,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 09:56:13,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 09:56:13,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 09:56:13,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 09:56:13,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 09:56:13,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 09:56:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 09:56:13,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 09:56:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 09:56:13,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 09:56:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 09:56:13,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 09:56:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-18 09:56:13,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-18 09:56:13,984 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 09:56:13,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 09:56:13 BoogieIcfgContainer [2018-09-18 09:56:13,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 09:56:13,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 09:56:13,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 09:56:13,989 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 09:56:13,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 09:56:13" (1/3) ... [2018-09-18 09:56:13,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5b9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 09:56:13, skipping insertion in model container [2018-09-18 09:56:13,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (2/3) ... [2018-09-18 09:56:13,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5b9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 09:56:13, skipping insertion in model container [2018-09-18 09:56:13,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 09:56:13" (3/3) ... [2018-09-18 09:56:13,993 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-09-18 09:56:14,003 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 09:56:14,011 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 09:56:14,063 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 09:56:14,064 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 09:56:14,064 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 09:56:14,065 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 09:56:14,065 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 09:56:14,065 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 09:56:14,065 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 09:56:14,065 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 09:56:14,066 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 09:56:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-18 09:56:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-18 09:56:14,089 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:14,090 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:14,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1728315421, now seen corresponding path program 1 times [2018-09-18 09:56:14,099 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:14,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,147 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 09:56:14,229 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 09:56:14,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-18 09:56:14,230 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:14,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-18 09:56:14,251 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-18 09:56:14,251 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-18 09:56:14,254 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-09-18 09:56:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:14,276 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-09-18 09:56:14,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-18 09:56:14,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-09-18 09:56:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:14,287 INFO L225 Difference]: With dead ends: 48 [2018-09-18 09:56:14,287 INFO L226 Difference]: Without dead ends: 24 [2018-09-18 09:56:14,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-18 09:56:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-18 09:56:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-18 09:56:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-18 09:56:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-09-18 09:56:14,334 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-09-18 09:56:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:14,335 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-09-18 09:56:14,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-18 09:56:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-09-18 09:56:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-18 09:56:14,336 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:14,336 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:14,337 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 374890024, now seen corresponding path program 1 times [2018-09-18 09:56:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,341 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 09:56:14,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 09:56:14,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-18 09:56:14,589 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:14,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-18 09:56:14,591 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-18 09:56:14,591 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-18 09:56:14,591 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2018-09-18 09:56:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:14,753 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-09-18 09:56:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 09:56:14,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-09-18 09:56:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:14,755 INFO L225 Difference]: With dead ends: 39 [2018-09-18 09:56:14,755 INFO L226 Difference]: Without dead ends: 27 [2018-09-18 09:56:14,756 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-18 09:56:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-18 09:56:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-18 09:56:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-18 09:56:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-18 09:56:14,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-09-18 09:56:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:14,763 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-18 09:56:14,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-18 09:56:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-18 09:56:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-18 09:56:14,765 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:14,765 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:14,765 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash 770504109, now seen corresponding path program 1 times [2018-09-18 09:56:14,765 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:14,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:14,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,767 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:15,057 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 14 [2018-09-18 09:56:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 09:56:15,173 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:15,173 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:15,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:15,194 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:15,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,496 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 09:56:15,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 10 [2018-09-18 09:56:15,496 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:15,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 09:56:15,497 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 09:56:15,500 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-18 09:56:15,501 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-18 09:56:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:15,704 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-09-18 09:56:15,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-18 09:56:15,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-18 09:56:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:15,708 INFO L225 Difference]: With dead ends: 54 [2018-09-18 09:56:15,708 INFO L226 Difference]: Without dead ends: 34 [2018-09-18 09:56:15,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-18 09:56:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-18 09:56:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-09-18 09:56:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-18 09:56:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-09-18 09:56:15,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2018-09-18 09:56:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:15,721 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-09-18 09:56:15,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 09:56:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-09-18 09:56:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-18 09:56:15,723 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:15,723 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:15,723 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -628173915, now seen corresponding path program 1 times [2018-09-18 09:56:15,724 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:15,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:15,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:15,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:15,726 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:16,069 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-09-18 09:56:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:16,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:16,151 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:16,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:16,172 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:16,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:16,474 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-18 09:56:16,493 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:56:16,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:16,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-09-18 09:56:16,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:16,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:16,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:22 [2018-09-18 09:56:17,072 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-09-18 09:56:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:17,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:17,753 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-09-18 09:56:17,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-09-18 09:56:17,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:17,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-18 09:56:17,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:17,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:17,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-18 09:56:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:18,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:18,117 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:18,135 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:18,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:18,175 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:56:18,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-09-18 09:56:18,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:22 [2018-09-18 09:56:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:18,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:18,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-18 09:56:18,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-09-18 09:56:18,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:18,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-18 09:56:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:18,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:18,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9, 9, 9] total 19 [2018-09-18 09:56:18,566 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:18,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-18 09:56:18,567 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-18 09:56:18,568 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-09-18 09:56:18,568 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-09-18 09:56:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:19,094 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-09-18 09:56:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 09:56:19,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-09-18 09:56:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:19,095 INFO L225 Difference]: With dead ends: 44 [2018-09-18 09:56:19,095 INFO L226 Difference]: Without dead ends: 32 [2018-09-18 09:56:19,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-09-18 09:56:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-18 09:56:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-09-18 09:56:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-18 09:56:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-09-18 09:56:19,103 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2018-09-18 09:56:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:19,103 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-09-18 09:56:19,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-18 09:56:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-09-18 09:56:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-18 09:56:19,105 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:19,105 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:19,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1419824368, now seen corresponding path program 2 times [2018-09-18 09:56:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:19,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:19,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:19,107 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:19,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:19,359 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:19,367 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:19,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:19,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:19,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:19,523 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:56:19,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:19,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:19,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:19,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-09-18 09:56:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:19,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:20,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-18 09:56:20,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:20,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-09-18 09:56:20,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:20,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:20,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-18 09:56:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:20,508 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:20,508 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:20,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:20,536 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:20,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:20,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:20,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:20,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:21,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:21,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11, 7, 7] total 33 [2018-09-18 09:56:21,266 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:21,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-18 09:56:21,267 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-18 09:56:21,268 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2018-09-18 09:56:21,268 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 15 states. [2018-09-18 09:56:21,637 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2018-09-18 09:56:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:22,059 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-09-18 09:56:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 09:56:22,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-18 09:56:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:22,062 INFO L225 Difference]: With dead ends: 47 [2018-09-18 09:56:22,062 INFO L226 Difference]: Without dead ends: 35 [2018-09-18 09:56:22,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=259, Invalid=1073, Unknown=0, NotChecked=0, Total=1332 [2018-09-18 09:56:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-18 09:56:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-18 09:56:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-18 09:56:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-09-18 09:56:22,070 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2018-09-18 09:56:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:22,071 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-09-18 09:56:22,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-18 09:56:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-09-18 09:56:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-18 09:56:22,072 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:22,073 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:22,073 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1813047355, now seen corresponding path program 3 times [2018-09-18 09:56:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:22,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:22,075 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:22,431 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:22,431 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:22,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:56:22,440 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:56:22,477 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-18 09:56:22,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:22,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-18 09:56:22,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:22,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:22,813 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:22,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:56:22,829 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:56:22,863 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-18 09:56:22,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:22,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-18 09:56:22,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-18 09:56:22,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:22,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 8, 4, 4] total 17 [2018-09-18 09:56:22,925 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:22,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 09:56:22,926 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 09:56:22,926 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-18 09:56:22,926 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-09-18 09:56:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:23,366 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-09-18 09:56:23,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 09:56:23,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-09-18 09:56:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:23,368 INFO L225 Difference]: With dead ends: 84 [2018-09-18 09:56:23,369 INFO L226 Difference]: Without dead ends: 60 [2018-09-18 09:56:23,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-09-18 09:56:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-18 09:56:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2018-09-18 09:56:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-18 09:56:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-09-18 09:56:23,379 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 29 [2018-09-18 09:56:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:23,379 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-09-18 09:56:23,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 09:56:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-09-18 09:56:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-18 09:56:23,380 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:23,381 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:23,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash 61056232, now seen corresponding path program 4 times [2018-09-18 09:56:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:23,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:23,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:23,383 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:23,686 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:23,686 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:56:23,693 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:56:23,712 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:56:23,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:23,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:23,922 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-18 09:56:24,157 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-18 09:56:24,345 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:56:24,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:24,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:24,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:24,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:24,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-09-18 09:56:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:24,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:25,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-09-18 09:56:25,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:25,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-18 09:56:25,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:25,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:25,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-18 09:56:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:26,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:26,189 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:56:26,205 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:56:26,250 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:56:26,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:26,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:26,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:27,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:27,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15, 11, 9] total 50 [2018-09-18 09:56:27,170 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:27,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-18 09:56:27,171 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-18 09:56:27,173 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2098, Unknown=0, NotChecked=0, Total=2450 [2018-09-18 09:56:27,173 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 22 states. [2018-09-18 09:56:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:29,338 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-09-18 09:56:29,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-18 09:56:29,338 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 35 [2018-09-18 09:56:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:29,340 INFO L225 Difference]: With dead ends: 83 [2018-09-18 09:56:29,340 INFO L226 Difference]: Without dead ends: 71 [2018-09-18 09:56:29,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 100 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=609, Invalid=3051, Unknown=0, NotChecked=0, Total=3660 [2018-09-18 09:56:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-18 09:56:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2018-09-18 09:56:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-18 09:56:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-09-18 09:56:29,352 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 35 [2018-09-18 09:56:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:29,352 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-09-18 09:56:29,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-18 09:56:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-09-18 09:56:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-18 09:56:29,357 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:29,357 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:29,357 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1491810029, now seen corresponding path program 5 times [2018-09-18 09:56:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:29,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:29,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:29,359 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:29,805 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-09-18 09:56:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-18 09:56:30,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:30,055 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:30,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:56:30,066 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:30,086 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-18 09:56:30,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:30,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:30,508 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:56:30,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:30,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:30,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:30,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:30,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:27 [2018-09-18 09:56:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:30,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:31,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-09-18 09:56:31,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:31,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-09-18 09:56:31,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:31,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:31,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-09-18 09:56:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:31,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:31,960 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:56:31,976 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:32,119 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-18 09:56:32,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:32,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-18 09:56:32,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-18 09:56:32,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:32,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 17, 5, 6] total 44 [2018-09-18 09:56:32,963 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:32,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-18 09:56:32,964 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-18 09:56:32,965 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2018-09-18 09:56:32,966 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 22 states. [2018-09-18 09:56:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:33,861 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-09-18 09:56:33,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-18 09:56:33,862 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-09-18 09:56:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:33,863 INFO L225 Difference]: With dead ends: 115 [2018-09-18 09:56:33,863 INFO L226 Difference]: Without dead ends: 76 [2018-09-18 09:56:33,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=311, Invalid=1945, Unknown=0, NotChecked=0, Total=2256 [2018-09-18 09:56:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-18 09:56:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2018-09-18 09:56:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-18 09:56:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-09-18 09:56:33,877 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 38 [2018-09-18 09:56:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:33,877 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-09-18 09:56:33,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-18 09:56:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-09-18 09:56:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-18 09:56:33,879 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:33,879 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:33,879 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:33,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1506953287, now seen corresponding path program 1 times [2018-09-18 09:56:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:33,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:33,880 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-18 09:56:34,505 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:34,505 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:34,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:34,513 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:34,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:35,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:35,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:35,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:35,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:55 [2018-09-18 09:56:35,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-18 09:56:35,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:36 [2018-09-18 09:56:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 09:56:36,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:36,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:36,866 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:36,867 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:36,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-09-18 09:56:36,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-18 09:56:36,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:36,919 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:36,920 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:36,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-09-18 09:56:36,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-18 09:56:37,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 51 treesize of output 51 [2018-09-18 09:56:37,127 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:37,136 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:37,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-09-18 09:56:37,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:37,186 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:37,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2018-09-18 09:56:37,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:37,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:56:37,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 53 [2018-09-18 09:56:37,355 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:37,356 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:37,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-09-18 09:56:37,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:37,363 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:37,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 42 [2018-09-18 09:56:37,375 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:37,528 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:56:37,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:56:37,596 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:137, output treesize:119 [2018-09-18 09:56:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-18 09:56:38,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:38,178 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:38,194 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:38,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-18 09:56:38,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-18 09:56:40,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:40,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24, 21, 6, 7] total 53 [2018-09-18 09:56:40,482 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:40,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-18 09:56:40,483 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-18 09:56:40,486 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2439, Unknown=0, NotChecked=0, Total=2756 [2018-09-18 09:56:40,486 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 29 states. [2018-09-18 09:56:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:42,651 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2018-09-18 09:56:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-18 09:56:42,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-09-18 09:56:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:42,653 INFO L225 Difference]: With dead ends: 150 [2018-09-18 09:56:42,653 INFO L226 Difference]: Without dead ends: 103 [2018-09-18 09:56:42,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=460, Invalid=3200, Unknown=0, NotChecked=0, Total=3660 [2018-09-18 09:56:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-18 09:56:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-09-18 09:56:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-18 09:56:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-09-18 09:56:42,671 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 50 [2018-09-18 09:56:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:42,672 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-09-18 09:56:42,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-18 09:56:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-09-18 09:56:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-18 09:56:42,674 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:42,674 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:42,674 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash 559942568, now seen corresponding path program 6 times [2018-09-18 09:56:42,674 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:42,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:42,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:42,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:42,676 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-09-18 09:56:42,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:42,863 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:42,870 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-18 09:56:42,870 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-18 09:56:42,926 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-18 09:56:42,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:42,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 49 proven. 51 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-18 09:56:43,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-18 09:56:44,409 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 09:56:44,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 14] total 30 [2018-09-18 09:56:44,409 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:44,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-18 09:56:44,410 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-18 09:56:44,410 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2018-09-18 09:56:44,411 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 12 states. [2018-09-18 09:56:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:45,099 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-09-18 09:56:45,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-18 09:56:45,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-09-18 09:56:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:45,102 INFO L225 Difference]: With dead ends: 128 [2018-09-18 09:56:45,102 INFO L226 Difference]: Without dead ends: 105 [2018-09-18 09:56:45,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2018-09-18 09:56:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-18 09:56:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2018-09-18 09:56:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-18 09:56:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-18 09:56:45,118 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 53 [2018-09-18 09:56:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-18 09:56:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-18 09:56:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-18 09:56:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-18 09:56:45,120 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:45,120 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:45,121 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:45,121 INFO L82 PathProgramCache]: Analyzing trace with hash -539553683, now seen corresponding path program 2 times [2018-09-18 09:56:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:45,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:45,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:45,122 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-18 09:56:45,353 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:45,353 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:45,361 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:45,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:45,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:45,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:45,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:45,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:45,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-18 09:56:45,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:45,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:45,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:55 [2018-09-18 09:56:45,817 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:45,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-09-18 09:56:45,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:45,853 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:45,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-09-18 09:56:45,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:45,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:56:45,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-09-18 09:56:46,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-09-18 09:56:46,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:46,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:46,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:45 [2018-09-18 09:56:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-18 09:56:48,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:49,579 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,580 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,581 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:49,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,581 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,582 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:49,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 95 [2018-09-18 09:56:49,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-18 09:56:49,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 63 treesize of output 63 [2018-09-18 09:56:49,674 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-09-18 09:56:49,754 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,755 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 79 [2018-09-18 09:56:49,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-09-18 09:56:49,795 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,797 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:49,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-09-18 09:56:49,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:49,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-18 09:56:49,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:56:50,092 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,093 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,097 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:50,098 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,099 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,101 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:50,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 93 [2018-09-18 09:56:50,122 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-18 09:56:50,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 61 treesize of output 61 [2018-09-18 09:56:50,305 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-09-18 09:56:50,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,367 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,368 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,371 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2018-09-18 09:56:50,375 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:50,380 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,388 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:50,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 73 [2018-09-18 09:56:50,428 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-09-18 09:56:50,521 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-18 09:56:50,599 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:56:50,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-18 09:56:50,774 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:173, output treesize:413 [2018-09-18 09:56:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-18 09:56:51,310 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:51,310 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:56:51,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:51,326 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:51,410 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:51,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:51,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-18 09:56:51,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-18 09:56:52,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:52,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 26, 23, 7, 8] total 63 [2018-09-18 09:56:52,608 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:52,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-18 09:56:52,609 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-18 09:56:52,610 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3535, Unknown=0, NotChecked=0, Total=3906 [2018-09-18 09:56:52,618 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2018-09-18 09:56:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:55,151 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-09-18 09:56:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-18 09:56:55,151 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-18 09:56:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:55,152 INFO L225 Difference]: With dead ends: 126 [2018-09-18 09:56:55,153 INFO L226 Difference]: Without dead ends: 80 [2018-09-18 09:56:55,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 191 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=579, Invalid=4823, Unknown=0, NotChecked=0, Total=5402 [2018-09-18 09:56:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-18 09:56:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-09-18 09:56:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-18 09:56:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-18 09:56:55,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2018-09-18 09:56:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:55,173 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-18 09:56:55,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-18 09:56:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-18 09:56:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-18 09:56:55,175 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:55,175 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:55,175 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash 964425273, now seen corresponding path program 3 times [2018-09-18 09:56:55,176 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:55,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:55,177 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:56,141 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-09-18 09:56:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-18 09:56:56,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:56,860 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:56:56,869 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:56:56,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-18 09:56:56,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:56,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:57,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-18 09:56:57,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-09-18 09:56:57,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-09-18 09:56:57,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-09-18 09:56:57,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-18 09:56:57,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2018-09-18 09:56:57,688 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:57,689 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:57,691 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:57,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2018-09-18 09:56:57,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:57,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-18 09:56:57,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-09-18 09:56:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 11 proven. 103 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-18 09:56:58,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:00,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 106 treesize of output 104 [2018-09-18 09:57:00,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:00,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-09-18 09:57:00,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:00,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:00,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:00,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 91 [2018-09-18 09:57:01,017 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,017 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,018 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,019 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,019 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,020 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,027 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:01,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 78 [2018-09-18 09:57:01,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:01,035 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,035 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,043 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,059 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:01,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 166 [2018-09-18 09:57:01,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 12 xjuncts. [2018-09-18 09:57:01,105 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:57:01,106 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:01,109 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,109 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,110 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,110 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,111 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 88 [2018-09-18 09:57:01,127 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:01,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-09-18 09:57:01,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-18 09:57:01,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-18 09:57:01,891 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,906 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,914 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,936 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,939 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,940 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:01,940 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,941 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:01,942 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:01,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 130 [2018-09-18 09:57:01,964 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:02,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 72 treesize of output 72 [2018-09-18 09:57:02,223 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-09-18 09:57:02,229 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,230 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,230 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-09-18 09:57:02,281 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:57:02,281 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:02,284 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,285 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,285 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,286 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 71 [2018-09-18 09:57:02,304 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:02,308 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,309 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,310 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 127 [2018-09-18 09:57:02,360 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 14 xjuncts. [2018-09-18 09:57:02,410 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,424 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,432 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,433 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,434 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,434 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:02,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2018-09-18 09:57:02,443 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:02,649 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-09-18 09:57:02,800 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-18 09:57:02,957 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-09-18 09:57:03,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-09-18 09:57:03,593 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:03,596 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-09-18 09:57:03,598 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:03,600 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,600 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,601 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,601 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-09-18 09:57:03,607 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:03,609 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-09-18 09:57:03,610 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:03,612 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:03,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-09-18 09:57:03,613 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:03,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-09-18 09:57:03,616 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:03,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-09-18 09:57:03,908 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 6 variables, input treesize:213, output treesize:328 [2018-09-18 09:57:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 11 proven. 65 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-18 09:57:04,361 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:04,361 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:57:04,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:57:04,378 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:57:05,037 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-18 09:57:05,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:05,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:05,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-18 09:57:05,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:7 [2018-09-18 09:57:05,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-18 09:57:05,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-09-18 09:57:05,144 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:57:05,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-09-18 09:57:05,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:19 [2018-09-18 09:57:05,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-18 09:57:05,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2018-09-18 09:57:05,651 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:05,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-09-18 09:57:05,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:05,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-09-18 09:57:05,942 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:05,964 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:05,987 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,035 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-09-18 09:57:06,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-09-18 09:57:06,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:06,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:58 [2018-09-18 09:57:06,281 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,282 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,282 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,283 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,288 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,289 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:06,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 59 [2018-09-18 09:57:06,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:06,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:67 [2018-09-18 09:57:07,123 WARN L178 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-18 09:57:08,261 WARN L178 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-09-18 09:57:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-18 09:57:09,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:13,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 78 treesize of output 81 [2018-09-18 09:57:13,790 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:13,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-09-18 09:57:13,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:13,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:13,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-09-18 09:57:13,838 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:13,841 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:13,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 76 [2018-09-18 09:57:13,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:13,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2018-09-18 09:57:13,871 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-09-18 09:57:14,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:57:14,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:57:14,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 78 treesize of output 81 [2018-09-18 09:57:14,268 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:14,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-09-18 09:57:14,274 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:14,274 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:14,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2018-09-18 09:57:14,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:14,322 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:14,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 76 [2018-09-18 09:57:14,341 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:14,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2018-09-18 09:57:14,347 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,426 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-09-18 09:57:14,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:57:14,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:57:14,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-18 09:57:14,881 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:157, output treesize:303 [2018-09-18 09:57:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-09-18 09:57:15,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:57:15,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 25, 29, 23] total 100 [2018-09-18 09:57:15,936 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:57:15,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-18 09:57:15,937 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-18 09:57:15,939 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1341, Invalid=8557, Unknown=2, NotChecked=0, Total=9900 [2018-09-18 09:57:15,940 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 54 states. [2018-09-18 09:57:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:57:19,639 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-09-18 09:57:19,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-18 09:57:19,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 74 [2018-09-18 09:57:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:57:19,641 INFO L225 Difference]: With dead ends: 90 [2018-09-18 09:57:19,641 INFO L226 Difference]: Without dead ends: 88 [2018-09-18 09:57:19,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 211 SyntacticMatches, 16 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5451 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=1891, Invalid=11679, Unknown=2, NotChecked=0, Total=13572 [2018-09-18 09:57:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-18 09:57:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-09-18 09:57:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-18 09:57:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-09-18 09:57:19,661 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 74 [2018-09-18 09:57:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:57:19,661 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-09-18 09:57:19,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-18 09:57:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-09-18 09:57:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-18 09:57:19,662 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:57:19,662 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:57:19,663 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:57:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2076817691, now seen corresponding path program 4 times [2018-09-18 09:57:19,663 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:57:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:19,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:57:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:19,664 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:57:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:57:20,335 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-09-18 09:57:20,900 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-09-18 09:57:21,182 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-09-18 09:57:21,442 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-09-18 09:57:21,688 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2018-09-18 09:57:21,906 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2018-09-18 09:57:22,096 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2018-09-18 09:57:22,297 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-09-18 09:57:22,442 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2018-09-18 09:57:22,593 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-09-18 09:57:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 132 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-18 09:57:23,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:23,225 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:57:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:57:23,233 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:57:23,263 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:57:23,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:23,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:23,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-09-18 09:57:23,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-09-18 09:57:23,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:23,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:70 [2018-09-18 09:57:23,489 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2018-09-18 09:57:23,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,525 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-09-18 09:57:23,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:23,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:96 [2018-09-18 09:57:23,747 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,748 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,749 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 78 [2018-09-18 09:57:23,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,798 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,799 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,801 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:23,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-09-18 09:57:23,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:23,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:118 [2018-09-18 09:57:24,056 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,057 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,058 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,058 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,059 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,060 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 112 [2018-09-18 09:57:24,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,133 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,135 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,136 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,137 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,138 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,139 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 111 [2018-09-18 09:57:24,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:24,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:142, output treesize:140 [2018-09-18 09:57:24,443 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:57:24,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-09-18 09:57:24,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:71 [2018-09-18 09:57:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 130 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 09:57:30,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:39,686 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,688 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,688 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:39,689 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,690 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,690 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,691 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,691 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,693 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:39,693 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,694 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 165 [2018-09-18 09:57:39,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:39,805 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,805 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,807 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,807 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,810 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,811 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:39,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,814 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:39,814 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 163 [2018-09-18 09:57:39,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:39,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 83 treesize of output 83 [2018-09-18 09:57:39,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-09-18 09:57:39,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-09-18 09:57:39,937 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,937 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,938 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,938 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,938 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,939 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2018-09-18 09:57:40,035 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,037 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,037 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,045 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 174 [2018-09-18 09:57:40,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-18 09:57:40,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 128 xjuncts. [2018-09-18 09:57:40,147 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,148 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,149 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,150 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,151 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,152 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,153 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,156 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,157 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,158 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,169 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 92 [2018-09-18 09:57:40,176 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:41,553 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 19 xjuncts. [2018-09-18 09:57:41,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-18 09:57:42,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-18 09:57:42,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-18 09:57:42,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 81 treesize of output 81 [2018-09-18 09:57:42,897 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-09-18 09:57:42,909 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,909 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,910 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 81 [2018-09-18 09:57:42,917 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,917 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,918 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,919 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 98 [2018-09-18 09:57:42,994 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,995 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,996 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:42,999 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,000 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,002 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,009 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 164 [2018-09-18 09:57:43,077 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-18 09:57:43,103 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 128 xjuncts. [2018-09-18 09:57:43,107 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,108 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,109 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,110 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,111 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,114 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,115 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,116 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,126 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:43,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 84 [2018-09-18 09:57:43,134 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:44,222 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-09-18 09:57:44,574 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-18 09:57:44,882 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-18 09:57:45,184 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-09-18 09:57:46,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-09-18 09:57:46,015 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:245, output treesize:1880 [2018-09-18 09:57:47,253 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2018-09-18 09:57:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 7 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-18 09:57:47,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:47,306 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:57:47,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:57:47,322 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:57:47,478 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:57:47,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:47,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:47,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-09-18 09:57:47,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-09-18 09:57:47,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:47,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:52 [2018-09-18 09:57:47,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-09-18 09:57:47,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-09-18 09:57:47,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:47,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:67 [2018-09-18 09:57:48,216 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:48,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-09-18 09:57:48,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:48,263 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:48,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-09-18 09:57:48,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:48,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-18 09:57:48,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:101 [2018-09-18 09:57:49,262 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,263 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,264 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2018-09-18 09:57:49,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,328 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,329 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,330 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 86 [2018-09-18 09:57:49,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-09-18 09:57:49,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:131, output treesize:129 [2018-09-18 09:57:49,895 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,895 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,896 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,897 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,898 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,900 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 100 [2018-09-18 09:57:49,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,989 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,990 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,991 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,993 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,994 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,995 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 116 [2018-09-18 09:57:50,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:50,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-09-18 09:57:50,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:159, output treesize:157 [2018-09-18 09:57:50,698 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,699 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,700 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,702 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,704 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,705 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,707 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,708 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,710 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,711 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 148 [2018-09-18 09:57:50,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:50,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-18 09:57:50,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:183, output treesize:92 [2018-09-18 09:57:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 120 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-18 09:57:57,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:13,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 81 treesize of output 84 [2018-09-18 09:58:13,024 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2018-09-18 09:58:13,030 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,031 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-09-18 09:58:13,039 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,040 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,040 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-09-18 09:58:13,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2018-09-18 09:58:13,106 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:13,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,124 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 92 [2018-09-18 09:58:13,155 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-09-18 09:58:13,320 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-18 09:58:13,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-18 09:58:13,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-18 09:58:13,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-18 09:58:13,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 81 treesize of output 84 [2018-09-18 09:58:13,817 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2018-09-18 09:58:13,822 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,822 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-09-18 09:58:13,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,832 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-09-18 09:58:13,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2018-09-18 09:58:13,892 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:13,896 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,904 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:13,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 92 [2018-09-18 09:58:13,937 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-09-18 09:58:14,091 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-09-18 09:58:14,191 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-18 09:58:14,277 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-18 09:58:14,375 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-09-18 09:58:14,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-09-18 09:58:14,785 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:163, output treesize:303 [2018-09-18 09:58:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 8 proven. 82 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-18 09:58:15,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:58:15,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 27, 29, 25] total 106 [2018-09-18 09:58:15,002 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:58:15,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-18 09:58:15,003 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-18 09:58:15,006 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=10101, Unknown=8, NotChecked=0, Total=11130 [2018-09-18 09:58:15,006 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 53 states. [2018-09-18 09:58:16,274 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 19 [2018-09-18 09:58:17,156 WARN L178 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2018-09-18 09:58:18,632 WARN L178 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2018-09-18 09:58:19,585 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-09-18 09:58:21,276 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 48 [2018-09-18 09:58:21,603 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2018-09-18 09:58:22,641 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 58 [2018-09-18 09:58:23,563 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 57 [2018-09-18 09:58:24,182 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 55 [2018-09-18 09:58:24,601 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 48 [2018-09-18 09:58:25,609 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 55 [2018-09-18 09:58:26,054 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 55 [2018-09-18 09:58:26,638 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 48 [2018-09-18 09:58:27,337 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 86 [2018-09-18 09:58:28,299 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 89 [2018-09-18 09:58:28,972 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2018-09-18 09:58:29,505 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2018-09-18 09:58:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:29,510 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-09-18 09:58:29,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-18 09:58:29,510 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 83 [2018-09-18 09:58:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:29,512 INFO L225 Difference]: With dead ends: 112 [2018-09-18 09:58:29,512 INFO L226 Difference]: Without dead ends: 110 [2018-09-18 09:58:29,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 248 SyntacticMatches, 13 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6144 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=1952, Invalid=16672, Unknown=8, NotChecked=0, Total=18632 [2018-09-18 09:58:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-18 09:58:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2018-09-18 09:58:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-18 09:58:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-18 09:58:29,536 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 83 [2018-09-18 09:58:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:29,537 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-18 09:58:29,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-18 09:58:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-18 09:58:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-18 09:58:29,538 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:58:29,538 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:58:29,539 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:58:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1083312199, now seen corresponding path program 5 times [2018-09-18 09:58:29,539 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:58:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:29,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:58:29,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:29,540 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:58:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 70 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-18 09:58:29,762 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:29,762 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:58:29,770 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:58:29,770 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:58:49,437 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-18 09:58:49,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:58:49,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-18 09:58:49,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-18 09:58:49,719 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:49,719 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-18 09:58:49,735 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:58:49,735 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:58:50,074 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-18 09:58:50,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:58:50,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-18 09:58:50,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-18 09:58:50,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:58:50,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 9] total 23 [2018-09-18 09:58:50,146 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:58:50,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-18 09:58:50,147 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-18 09:58:50,147 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-09-18 09:58:50,147 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 16 states. [2018-09-18 09:58:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:50,446 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-09-18 09:58:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-18 09:58:50,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2018-09-18 09:58:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:50,447 INFO L225 Difference]: With dead ends: 164 [2018-09-18 09:58:50,447 INFO L226 Difference]: Without dead ends: 0 [2018-09-18 09:58:50,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-09-18 09:58:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-18 09:58:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-18 09:58:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-18 09:58:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-18 09:58:50,449 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2018-09-18 09:58:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:50,449 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-18 09:58:50,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-18 09:58:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-18 09:58:50,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-18 09:58:50,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-18 09:58:50,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:50,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:50,810 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 250 [2018-09-18 09:58:53,784 WARN L178 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 263 DAG size of output: 35 [2018-09-18 09:58:54,504 WARN L178 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 90 [2018-09-18 09:58:58,072 WARN L178 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 211 DAG size of output: 88 [2018-09-18 09:58:59,919 WARN L178 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 250 DAG size of output: 98 [2018-09-18 09:58:59,922 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-18 09:58:59,922 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-18 09:58:59,923 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-18 09:58:59,923 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-18 09:58:59,923 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-18 09:58:59,923 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-18 09:58:59,923 INFO L422 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (let ((.cse25 (+ main_~max~0 4294967295))) (let ((.cse9 (div .cse25 4294967296))) (let ((.cse5 (mod .cse25 4294967296)) (.cse8 (+ main_~i~0 (* 4294967296 .cse9))) (.cse6 (= main_~max~0 5))) (or (and (exists ((main_~max~0 Int)) (let ((.cse4 (+ main_~max~0 4294967295))) (let ((.cse3 (div .cse4 4294967296))) (let ((.cse1 (* 4294967296 .cse3)) (.cse2 (mod .cse4 4294967296)) (.cse0 (* (- 4294967296) .cse3))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse0 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse0 4294967292))) (< (+ main_~max~0 4294967290) .cse1) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967291)) (select main_~str2~0 4)) (= .cse2 (+ main_~j~0 1)) (<= .cse1 (+ main_~max~0 4294967291)) (<= .cse2 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse0 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967294)) (select main_~str2~0 1))))))) (= .cse5 (+ main_~i~0 3)) .cse6) (let ((.cse7 (* (- 4294967296) .cse9))) (and (= main_~j~0 1) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse7 4294967292))) (= (select main_~str1~0 (+ main_~max~0 .cse7 4294967291)) (select main_~str2~0 4)) (= .cse8 (+ main_~max~0 4294967294)) .cse6 (= (select main_~str1~0 3) (select main_~str2~0 1)) (= (select main_~str2~0 2) (select main_~str1~0 (+ .cse5 (- 2)))) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse7 4294967295))))) (and (exists ((main_~max~0 Int)) (let ((.cse14 (+ main_~max~0 4294967295))) (let ((.cse13 (div .cse14 4294967296))) (let ((.cse11 (* 4294967296 .cse13)) (.cse12 (mod .cse14 4294967296)) (.cse10 (* (- 4294967296) .cse13))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse10 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse10 4294967292))) (< (+ main_~max~0 4294967290) .cse11) (= (select main_~str1~0 (+ main_~max~0 .cse10 4294967291)) (select main_~str2~0 4)) (<= .cse11 (+ main_~max~0 4294967291)) (<= .cse12 2147483647) (= main_~j~0 .cse12) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse10 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse10 4294967294)) (select main_~str2~0 1))))))) .cse6 (= main_~i~0 0)) (and .cse6 (= main_~i~0 4) (exists ((main_~max~0 Int)) (let ((.cse19 (+ main_~max~0 4294967295))) (let ((.cse18 (div .cse19 4294967296))) (let ((.cse17 (* 4294967296 .cse18)) (.cse16 (mod .cse19 4294967296)) (.cse15 (* (- 4294967296) .cse18))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse15 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse15 4294967292))) (= .cse16 (+ main_~j~0 4)) (< (+ main_~max~0 4294967290) .cse17) (= (select main_~str1~0 (+ main_~max~0 .cse15 4294967291)) (select main_~str2~0 4)) (<= .cse17 (+ main_~max~0 4294967291)) (<= .cse16 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse15 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse15 4294967294)) (select main_~str2~0 1)))))))) (and (= .cse8 (+ main_~max~0 4294967293)) .cse6 (exists ((main_~max~0 Int)) (let ((.cse24 (+ main_~max~0 4294967295))) (let ((.cse23 (div .cse24 4294967296))) (let ((.cse21 (* 4294967296 .cse23)) (.cse22 (mod .cse24 4294967296)) (.cse20 (* (- 4294967296) .cse23))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse20 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse20 4294967292))) (< (+ main_~max~0 4294967290) .cse21) (= (select main_~str1~0 (+ main_~max~0 .cse20 4294967291)) (select main_~str2~0 4)) (<= .cse21 (+ main_~max~0 4294967291)) (<= .cse22 2147483647) (= (+ main_~j~0 2) .cse22) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse20 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse20 4294967294)) (select main_~str2~0 1)))))))))))) [2018-09-18 09:58:59,923 INFO L426 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2018-09-18 09:58:59,923 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 11 34) no Hoare annotation was computed. [2018-09-18 09:58:59,924 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 11 34) the Hoare annotation is: true [2018-09-18 09:58:59,924 INFO L426 ceAbstractionStarter]: For program point L30-1(lines 30 33) no Hoare annotation was computed. [2018-09-18 09:58:59,924 INFO L426 ceAbstractionStarter]: For program point L30-3(lines 30 33) no Hoare annotation was computed. [2018-09-18 09:58:59,924 INFO L422 ceAbstractionStarter]: At program point L30-4(lines 30 33) the Hoare annotation is: (let ((.cse32 (+ main_~max~0 4294967295))) (let ((.cse31 (div .cse32 4294967296))) (let ((.cse5 (mod .cse32 4294967296)) (.cse30 (* (- 4294967296) .cse31)) (.cse29 (* 4294967296 .cse31))) (let ((.cse19 (+ main_~i~0 .cse29)) (.cse23 (+ main_~max~0 4294967293)) (.cse20 (select main_~str2~0 1)) (.cse17 (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse30 4294967292)))) (.cse18 (= (select main_~str1~0 (+ main_~max~0 .cse30 4294967291)) (select main_~str2~0 4))) (.cse6 (= main_~max~0 5)) (.cse21 (= (select main_~str2~0 2) (select main_~str1~0 (+ .cse5 (- 2))))) (.cse22 (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse30 4294967295))))) (or (and (exists ((main_~max~0 Int)) (let ((.cse4 (+ main_~max~0 4294967295))) (let ((.cse3 (div .cse4 4294967296))) (let ((.cse1 (* 4294967296 .cse3)) (.cse2 (mod .cse4 4294967296)) (.cse0 (* (- 4294967296) .cse3))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse0 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse0 4294967292))) (< (+ main_~max~0 4294967290) .cse1) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967291)) (select main_~str2~0 4)) (= .cse2 (+ main_~j~0 1)) (<= .cse1 (+ main_~max~0 4294967291)) (<= .cse2 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse0 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse0 4294967294)) (select main_~str2~0 1))))))) (= .cse5 (+ main_~i~0 3)) .cse6) (and (exists ((main_~max~0 Int)) (let ((.cse11 (+ main_~max~0 4294967295))) (let ((.cse10 (div .cse11 4294967296))) (let ((.cse8 (* 4294967296 .cse10)) (.cse9 (mod .cse11 4294967296)) (.cse7 (* (- 4294967296) .cse10))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse7 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse7 4294967292))) (< (+ main_~max~0 4294967290) .cse8) (= (select main_~str1~0 (+ main_~max~0 .cse7 4294967291)) (select main_~str2~0 4)) (<= .cse8 (+ main_~max~0 4294967291)) (<= .cse9 2147483647) (= main_~j~0 .cse9) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse7 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse7 4294967294)) (select main_~str2~0 1))))))) .cse6 (= main_~i~0 0)) (and .cse6 (= main_~i~0 4) (exists ((main_~max~0 Int)) (let ((.cse16 (+ main_~max~0 4294967295))) (let ((.cse15 (div .cse16 4294967296))) (let ((.cse14 (* 4294967296 .cse15)) (.cse13 (mod .cse16 4294967296)) (.cse12 (* (- 4294967296) .cse15))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse12 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse12 4294967292))) (= .cse13 (+ main_~j~0 4)) (< (+ main_~max~0 4294967290) .cse14) (= (select main_~str1~0 (+ main_~max~0 .cse12 4294967291)) (select main_~str2~0 4)) (<= .cse14 (+ main_~max~0 4294967291)) (<= .cse13 2147483647) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse12 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse12 4294967294)) (select main_~str2~0 1)))))))) (and (= main_~j~0 1) .cse17 .cse18 (= .cse19 (+ main_~max~0 4294967294)) .cse6 (= (select main_~str1~0 3) .cse20) .cse21 .cse22) (and (= .cse19 .cse23) .cse6 (exists ((main_~max~0 Int)) (let ((.cse28 (+ main_~max~0 4294967295))) (let ((.cse27 (div .cse28 4294967296))) (let ((.cse25 (* 4294967296 .cse27)) (.cse26 (mod .cse28 4294967296)) (.cse24 (* (- 4294967296) .cse27))) (and (= (select main_~str2~0 2) (select main_~str1~0 (+ main_~max~0 .cse24 4294967293))) (= (select main_~str2~0 3) (select main_~str1~0 (+ main_~max~0 .cse24 4294967292))) (< (+ main_~max~0 4294967290) .cse25) (= (select main_~str1~0 (+ main_~max~0 .cse24 4294967291)) (select main_~str2~0 4)) (<= .cse25 (+ main_~max~0 4294967291)) (<= .cse26 2147483647) (= (+ main_~j~0 2) .cse26) (= (select main_~str2~0 0) (select main_~str1~0 (+ main_~max~0 .cse24 4294967295))) (= (select main_~str1~0 (+ main_~max~0 .cse24 4294967294)) (select main_~str2~0 1)))))))) (and (and (not (= .cse23 (+ main_~i~0 main_~j~0 .cse29))) (= .cse20 (select main_~str1~0 (+ .cse5 (- 1)))) .cse17 .cse18 .cse6 .cse21 .cse22) (= main_~i~0 5))))))) [2018-09-18 09:58:59,924 INFO L426 ceAbstractionStarter]: For program point L30-5(lines 11 34) no Hoare annotation was computed. [2018-09-18 09:58:59,924 INFO L426 ceAbstractionStarter]: For program point L24-1(lines 24 27) no Hoare annotation was computed. [2018-09-18 09:58:59,925 INFO L426 ceAbstractionStarter]: For program point L24-3(lines 24 27) no Hoare annotation was computed. [2018-09-18 09:58:59,925 INFO L422 ceAbstractionStarter]: At program point L24-4(lines 24 27) the Hoare annotation is: (let ((.cse8 (+ main_~max~0 4294967295))) (let ((.cse9 (* 4294967296 (div .cse8 4294967296)))) (let ((.cse6 (select main_~str1~0 (+ main_~i~0 3))) (.cse0 (select main_~str1~0 (+ main_~i~0 2))) (.cse5 (select main_~str2~0 1)) (.cse4 (select main_~str1~0 (+ main_~i~0 1))) (.cse7 (select main_~str2~0 2)) (.cse3 (= main_~max~0 5)) (.cse2 (+ main_~i~0 .cse9)) (.cse1 (select main_~str2~0 0)) (.cse10 (mod .cse8 4294967296))) (or (and (and (= main_~j~0 2) (= .cse0 .cse1) (= .cse2 (+ main_~max~0 4294967293))) .cse3 (= .cse4 .cse5)) (and (= main_~j~0 4) (and (= .cse1 (select main_~str1~0 (+ main_~i~0 4))) (= (select main_~str2~0 (+ main_~j~0 (- 3))) .cse6) (= .cse4 (select main_~str2~0 (+ main_~j~0 (- 1))))) .cse3 (= .cse0 .cse7) (= main_~i~0 0)) (and .cse3 (and (= main_~j~0 3) (= .cse1 .cse6)) (= main_~i~0 1) (= .cse4 .cse7) (= .cse5 .cse0)) (and .cse3 (= main_~j~0 0) (= main_~i~0 4)) (let ((.cse11 (+ main_~i~0 5))) (and (<= .cse8 (+ main_~i~0 main_~j~0 .cse9)) (= .cse5 (select main_~str1~0 (+ .cse10 (- 1)))) (= .cse11 .cse10) (= .cse4 (select main_~str2~0 4)) (= (select main_~str2~0 3) (select main_~str1~0 (+ .cse10 (- 3)))) .cse3 (= .cse1 (select main_~str1~0 .cse11)) (= .cse7 (select main_~str1~0 (+ .cse10 (- 2)))))) (and .cse3 (= .cse2 (+ main_~max~0 4294967294)) (= .cse1 (select main_~str1~0 .cse10)) (= main_~j~0 1)))))) [2018-09-18 09:58:59,925 INFO L426 ceAbstractionStarter]: For program point L24-5(lines 24 27) no Hoare annotation was computed. [2018-09-18 09:58:59,925 INFO L426 ceAbstractionStarter]: For program point L16-1(lines 16 18) no Hoare annotation was computed. [2018-09-18 09:58:59,925 INFO L426 ceAbstractionStarter]: For program point L16-3(lines 16 18) no Hoare annotation was computed. [2018-09-18 09:58:59,925 INFO L422 ceAbstractionStarter]: At program point L16-4(lines 16 18) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (.cse2 (<= 5 main_~max~0))) (let ((.cse0 (and (<= main_~max~0 5) (<= 4294967298 .cse1) .cse2))) (or (and .cse0 (< main_~i~0 4)) (and .cse0 (= main_~i~0 4)) (and .cse0 (= main_~i~0 5)) (and (= main_~max~0 5) (<= 4294967297 .cse1) (<= main_~i~0 1)) (and (<= main_~max~0 (+ (* 2 main_~i~0) 5)) .cse2 (= main_~i~0 0))))) [2018-09-18 09:58:59,925 INFO L426 ceAbstractionStarter]: For program point L16-5(lines 16 18) no Hoare annotation was computed. [2018-09-18 09:58:59,925 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-18 09:58:59,925 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-18 09:58:59,926 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-18 09:58:59,926 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-18 09:58:59,926 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-18 09:58:59,926 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-18 09:58:59,950 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,954 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,954 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,954 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,954 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:58:59,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 09:58:59 BoogieIcfgContainer [2018-09-18 09:58:59,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 09:58:59,992 INFO L168 Benchmark]: Toolchain (without parser) took 166957.93 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-18 09:58:59,994 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 09:58:59,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-18 09:58:59,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 09:58:59,995 INFO L168 Benchmark]: Boogie Preprocessor took 40.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 09:58:59,995 INFO L168 Benchmark]: RCFGBuilder took 550.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-09-18 09:58:59,999 INFO L168 Benchmark]: TraceAbstraction took 166005.64 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -290.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-18 09:59:00,001 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 550.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166005.64 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 371.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -290.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((((max <= 5 && 4294967298 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 5 <= max) && i < 4) || (((max <= 5 && 4294967298 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 5 <= max) && i == 4)) || (((max <= 5 && 4294967298 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && 5 <= max) && i == 5)) || ((max == 5 && 4294967297 <= i + 4294967296 * ((max + 4294967295) / 4294967296)) && i <= 1)) || ((max <= 2 * i + 5 && 5 <= max) && i == 0) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((((((j == 2 && str1[i + 2] == str2[0]) && i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967293) && max == 5) && str1[i + 1] == str2[1]) || ((((j == 4 && (str2[0] == str1[i + 4] && str2[j + -3] == str1[i + 3]) && str1[i + 1] == str2[j + -1]) && max == 5) && str1[i + 2] == str2[2]) && i == 0)) || ((((max == 5 && j == 3 && str2[0] == str1[i + 3]) && i == 1) && str1[i + 1] == str2[2]) && str2[1] == str1[i + 2])) || ((max == 5 && j == 0) && i == 4)) || (((((((max + 4294967295 <= i + j + 4294967296 * ((max + 4294967295) / 4294967296) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && i + 5 == (max + 4294967295) % 4294967296) && str1[i + 1] == str2[4]) && str2[3] == str1[(max + 4294967295) % 4294967296 + -3]) && max == 5) && str2[0] == str1[i + 5]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2])) || (((max == 5 && i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967294) && str2[0] == str1[(max + 4294967295) % 4294967296]) && j == 1) - InvariantResult [Line: 30]: Loop Invariant [2018-09-18 09:59:00,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,027 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] [2018-09-18 09:59:00,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~max~0,QUANTIFIED] Derived loop invariant: (((((((\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && (main_~max~0 + 4294967295) % 4294967296 == j + 1) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]) && (max + 4294967295) % 4294967296 == i + 3) && max == 5) || (((\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && j == (main_~max~0 + 4294967295) % 4294967296) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]) && max == 5) && i == 0)) || ((max == 5 && i == 4) && (\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && (main_~max~0 + 4294967295) % 4294967296 == j + 4) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]))) || (((((((j == 1 && str2[3] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967292]) && str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967291] == str2[4]) && i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967294) && max == 5) && str1[3] == str2[1]) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[0] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967295])) || ((i + 4294967296 * ((max + 4294967295) / 4294967296) == max + 4294967293 && max == 5) && (\exists main_~max~0 : int :: (((((((str2[2] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967293] && str2[3] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967292]) && main_~max~0 + 4294967290 < 4294967296 * ((main_~max~0 + 4294967295) / 4294967296)) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967291] == str2[4]) && 4294967296 * ((main_~max~0 + 4294967295) / 4294967296) <= main_~max~0 + 4294967291) && (main_~max~0 + 4294967295) % 4294967296 <= 2147483647) && j + 2 == (main_~max~0 + 4294967295) % 4294967296) && str2[0] == str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967295]) && str1[main_~max~0 + -4294967296 * ((main_~max~0 + 4294967295) / 4294967296) + 4294967294] == str2[1]))) || (((((((!(max + 4294967293 == i + j + 4294967296 * ((max + 4294967295) / 4294967296)) && str2[1] == str1[(max + 4294967295) % 4294967296 + -1]) && str2[3] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967292]) && str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967291] == str2[4]) && max == 5) && str2[2] == str1[(max + 4294967295) % 4294967296 + -2]) && str2[0] == str1[max + -4294967296 * ((max + 4294967295) / 4294967296) + 4294967295]) && i == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 165.8s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 9.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 730 SDslu, 4665 SDs, 0 SdLazy, 7219 SolverSat, 703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2442 GetRequests, 1746 SyntacticMatches, 67 SemanticMatches, 629 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15538 ImplicationChecksByTransitivity, 101.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 149 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 33 PreInvPairs, 64 NumberOfFragments, 1677 HoareAnnotationTreeSize, 33 FomulaSimplifications, 326549 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 283841 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 21.8s SatisfiabilityAnalysisTime, 104.0s InterpolantComputationTime, 1714 NumberOfCodeBlocks, 1702 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 2753 ConstructedInterpolants, 197 QuantifiedInterpolants, 3103944 SizeOfPredicates, 111 NumberOfNonLiveVariables, 2315 ConjunctsInSsa, 648 ConjunctsInUnsatCore, 58 InterpolantComputations, 5 PerfectInterpolantSequences, 1952/4014 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-18_09-59-00-051.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-18_09-59-00-051.csv Received shutdown request...