java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:18:01,547 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:18:01,549 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:18:01,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:18:01,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:18:01,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:18:01,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:18:01,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:18:01,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:18:01,568 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:18:01,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:18:01,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:18:01,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:18:01,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:18:01,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:18:01,574 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:18:01,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:18:01,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:18:01,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:18:01,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:18:01,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:18:01,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:18:01,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:18:01,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:18:01,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:18:01,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:18:01,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:18:01,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:18:01,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:18:01,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:18:01,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:18:01,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:18:01,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:18:01,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:18:01,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:18:01,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:18:01,613 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 22:18:01,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:18:01,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:18:01,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:18:01,641 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:18:01,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:18:01,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:18:01,642 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:18:01,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:18:01,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:18:01,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:18:01,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:18:01,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:18:01,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:18:01,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:18:01,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:18:01,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:18:01,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:18:01,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:18:01,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:18:01,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:18:01,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:18:01,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:18:01,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:18:01,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:18:01,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:18:01,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:18:01,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:18:01,646 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 22:18:01,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:18:01,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:18:01,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:18:01,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:18:01,720 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:18:01,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-26 22:18:01,784 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/76a066a3b/adc8faa38e4449daa5aa9f5a38cb3d32/FLAG2a506a707 [2018-10-26 22:18:02,300 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:18:02,301 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-10-26 22:18:02,308 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/76a066a3b/adc8faa38e4449daa5aa9f5a38cb3d32/FLAG2a506a707 [2018-10-26 22:18:02,322 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/76a066a3b/adc8faa38e4449daa5aa9f5a38cb3d32 [2018-10-26 22:18:02,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:18:02,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:18:02,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:18:02,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:18:02,339 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:18:02,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccbb6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02, skipping insertion in model container [2018-10-26 22:18:02,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:18:02,376 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:18:02,551 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:18:02,564 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:18:02,588 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:18:02,609 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:18:02,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02 WrapperNode [2018-10-26 22:18:02,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:18:02,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:18:02,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:18:02,612 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:18:02,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:18:02,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:18:02,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:18:02,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:18:02,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... [2018-10-26 22:18:02,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:18:02,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:18:02,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:18:02,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:18:02,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:18:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:18:02,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:18:03,286 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:18:03,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:18:03 BoogieIcfgContainer [2018-10-26 22:18:03,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:18:03,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:18:03,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:18:03,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:18:03,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:18:02" (1/3) ... [2018-10-26 22:18:03,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aceab8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:18:03, skipping insertion in model container [2018-10-26 22:18:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:18:02" (2/3) ... [2018-10-26 22:18:03,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aceab8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:18:03, skipping insertion in model container [2018-10-26 22:18:03,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:18:03" (3/3) ... [2018-10-26 22:18:03,302 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-10-26 22:18:03,312 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:18:03,321 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:18:03,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:18:03,370 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:18:03,370 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:18:03,371 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:18:03,371 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:18:03,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:18:03,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:18:03,371 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:18:03,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:18:03,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:18:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-26 22:18:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 22:18:03,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:03,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:03,398 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:03,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1826021660, now seen corresponding path program 1 times [2018-10-26 22:18:03,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:03,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:03,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:03,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:18:03,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:18:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:18:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:18:03,616 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2018-10-26 22:18:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:03,632 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-26 22:18:03,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:18:03,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2018-10-26 22:18:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:03,647 INFO L225 Difference]: With dead ends: 25 [2018-10-26 22:18:03,647 INFO L226 Difference]: Without dead ends: 12 [2018-10-26 22:18:03,651 INFO L605 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-10-26 22:18:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-26 22:18:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-26 22:18:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-26 22:18:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-10-26 22:18:03,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2018-10-26 22:18:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:03,683 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-10-26 22:18:03,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:18:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2018-10-26 22:18:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 22:18:03,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:03,685 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:03,685 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:03,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash -408232241, now seen corresponding path program 1 times [2018-10-26 22:18:03,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:03,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:03,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:03,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:03,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:03,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:18:03,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:18:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:18:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:18:03,933 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2018-10-26 22:18:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:04,027 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-10-26 22:18:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:18:04,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-26 22:18:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:04,029 INFO L225 Difference]: With dead ends: 25 [2018-10-26 22:18:04,030 INFO L226 Difference]: Without dead ends: 21 [2018-10-26 22:18:04,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:18:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-26 22:18:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-10-26 22:18:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-26 22:18:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-10-26 22:18:04,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 10 [2018-10-26 22:18:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:04,036 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-10-26 22:18:04,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:18:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-10-26 22:18:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 22:18:04,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:04,038 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:04,038 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:04,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash -408291823, now seen corresponding path program 1 times [2018-10-26 22:18:04,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:04,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:04,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:18:04,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:18:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:18:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:18:04,128 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-10-26 22:18:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:04,182 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-10-26 22:18:04,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:18:04,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-26 22:18:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:04,184 INFO L225 Difference]: With dead ends: 21 [2018-10-26 22:18:04,184 INFO L226 Difference]: Without dead ends: 16 [2018-10-26 22:18:04,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:18:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-26 22:18:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-26 22:18:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-26 22:18:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-10-26 22:18:04,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2018-10-26 22:18:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:04,189 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-10-26 22:18:04,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:18:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-10-26 22:18:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:18:04,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:04,190 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:04,191 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:04,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash -380457259, now seen corresponding path program 1 times [2018-10-26 22:18:04,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:04,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:04,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:04,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:18:04,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:18:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:18:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:18:04,609 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2018-10-26 22:18:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:04,792 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-10-26 22:18:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:18:04,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-26 22:18:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:04,794 INFO L225 Difference]: With dead ends: 37 [2018-10-26 22:18:04,794 INFO L226 Difference]: Without dead ends: 26 [2018-10-26 22:18:04,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:18:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-26 22:18:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-10-26 22:18:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-26 22:18:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-26 22:18:04,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-10-26 22:18:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:04,800 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-26 22:18:04,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:18:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-26 22:18:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:18:04,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:04,801 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:04,802 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:04,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash -323198957, now seen corresponding path program 1 times [2018-10-26 22:18:04,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:04,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:04,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:04,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:18:04,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:18:04,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:18:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:18:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:18:04,949 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2018-10-26 22:18:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:05,117 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-26 22:18:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:18:05,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-10-26 22:18:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:05,120 INFO L225 Difference]: With dead ends: 40 [2018-10-26 22:18:05,120 INFO L226 Difference]: Without dead ends: 31 [2018-10-26 22:18:05,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:18:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-26 22:18:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-10-26 22:18:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 22:18:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-26 22:18:05,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-10-26 22:18:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:05,126 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-26 22:18:05,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:18:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-26 22:18:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:18:05,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:05,127 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:05,128 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:05,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 299601111, now seen corresponding path program 1 times [2018-10-26 22:18:05,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:05,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:05,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:05,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:05,467 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-26 22:18:05,942 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-26 22:18:06,175 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-10-26 22:18:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:06,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:06,264 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:18:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:06,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:06,690 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 22:18:07,120 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2018-10-26 22:18:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:07,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:07,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-26 22:18:07,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:18:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:18:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:18:07,209 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2018-10-26 22:18:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:07,822 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-10-26 22:18:07,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:18:07,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-10-26 22:18:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:07,824 INFO L225 Difference]: With dead ends: 36 [2018-10-26 22:18:07,824 INFO L226 Difference]: Without dead ends: 31 [2018-10-26 22:18:07,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:18:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-26 22:18:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-10-26 22:18:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-26 22:18:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-10-26 22:18:07,830 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-10-26 22:18:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:07,831 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-26 22:18:07,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:18:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-10-26 22:18:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 22:18:07,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:07,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:07,832 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:07,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 356859413, now seen corresponding path program 1 times [2018-10-26 22:18:07,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:07,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:08,214 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 26 [2018-10-26 22:18:08,499 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 20 [2018-10-26 22:18:08,714 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 22 [2018-10-26 22:18:08,892 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 24 [2018-10-26 22:18:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:08,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:08,896 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:18:08,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:08,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:08,992 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:18:08,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-10-26 22:18:09,044 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 18 treesize of output 17 [2018-10-26 22:18:09,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,065 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:109, output treesize:24 [2018-10-26 22:18:09,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-10-26 22:18:09,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2018-10-26 22:18:09,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-10-26 22:18:09,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-10-26 22:18:09,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:09,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 22:18:09,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:85, output treesize:44 [2018-10-26 22:18:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:09,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:09,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-10-26 22:18:09,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:18:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:18:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:18:09,453 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 11 states. [2018-10-26 22:18:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:09,862 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-10-26 22:18:09,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:18:09,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-10-26 22:18:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:09,864 INFO L225 Difference]: With dead ends: 31 [2018-10-26 22:18:09,864 INFO L226 Difference]: Without dead ends: 25 [2018-10-26 22:18:09,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:18:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-26 22:18:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-26 22:18:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-26 22:18:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-26 22:18:09,870 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2018-10-26 22:18:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:09,871 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-26 22:18:09,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:18:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-26 22:18:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 22:18:09,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:09,873 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:09,873 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:09,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1720764661, now seen corresponding path program 1 times [2018-10-26 22:18:09,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:09,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:10,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:10,010 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:10,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:10,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:10,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-26 22:18:10,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:18:10,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:18:10,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:18:10,099 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-10-26 22:18:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:10,168 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-26 22:18:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:18:10,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-26 22:18:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:10,170 INFO L225 Difference]: With dead ends: 45 [2018-10-26 22:18:10,170 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 22:18:10,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:18:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 22:18:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-10-26 22:18:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-26 22:18:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-26 22:18:10,176 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-10-26 22:18:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:10,177 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-26 22:18:10,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:18:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-10-26 22:18:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 22:18:10,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:10,178 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:10,179 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:10,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1097964593, now seen corresponding path program 2 times [2018-10-26 22:18:10,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:10,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:18:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:10,579 WARN L179 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-26 22:18:10,800 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-10-26 22:18:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:10,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:10,957 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:18:10,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:18:11,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-26 22:18:11,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:11,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:11,629 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2018-10-26 22:18:12,645 WARN L179 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-10-26 22:18:13,482 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 22:18:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:18:13,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:13,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-10-26 22:18:13,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 22:18:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 22:18:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:18:13,524 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 12 states. [2018-10-26 22:18:13,908 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2018-10-26 22:18:15,321 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-10-26 22:18:15,444 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2018-10-26 22:18:19,165 WARN L179 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-10-26 22:18:25,616 WARN L179 SmtUtils]: Spent 6.41 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-10-26 22:18:26,436 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2018-10-26 22:18:27,036 WARN L179 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-10-26 22:18:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:18:27,074 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-10-26 22:18:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:18:27,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-26 22:18:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:18:27,079 INFO L225 Difference]: With dead ends: 42 [2018-10-26 22:18:27,079 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 22:18:27,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-10-26 22:18:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 22:18:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-10-26 22:18:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-26 22:18:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-10-26 22:18:27,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-10-26 22:18:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:18:27,087 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-26 22:18:27,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 22:18:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-10-26 22:18:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 22:18:27,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:18:27,089 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:18:27,089 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:18:27,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:18:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1040706291, now seen corresponding path program 2 times [2018-10-26 22:18:27,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:18:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:18:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:27,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:18:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:18:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:18:35,905 WARN L179 SmtUtils]: Spent 8.43 s on a formula simplification. DAG size of input: 119 DAG size of output: 49 [2018-10-26 22:18:36,800 WARN L179 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 68 [2018-10-26 22:18:37,094 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 65 [2018-10-26 22:18:40,088 WARN L179 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 174 DAG size of output: 109 [2018-10-26 22:18:42,756 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 71 [2018-10-26 22:18:43,109 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 67 [2018-10-26 22:18:43,410 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2018-10-26 22:18:44,001 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 31 [2018-10-26 22:18:44,295 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 41 [2018-10-26 22:18:46,604 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 90 DAG size of output: 20 [2018-10-26 22:18:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:46,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:18:46,613 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:18:46,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:18:46,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:18:46,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:18:46,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:18:46,703 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:18:46,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:46,717 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:18:46,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:47,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-10-26 22:18:47,151 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 18 treesize of output 17 [2018-10-26 22:18:47,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:47,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:47,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-10-26 22:18:47,175 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 18 treesize of output 17 [2018-10-26 22:18:47,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:47,186 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:47,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:18:47,222 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:286, output treesize:72 [2018-10-26 22:18:50,127 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-10-26 22:18:50,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-10-26 22:18:50,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2018-10-26 22:18:50,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-10-26 22:18:50,758 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 0 case distinctions, treesize of input 45 treesize of output 54 [2018-10-26 22:18:50,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-10-26 22:18:50,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,865 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2018-10-26 22:18:50,866 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,883 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-10-26 22:18:50,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:18:50,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2018-10-26 22:18:50,962 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:18:50,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:18:51,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 22:18:51,024 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:269, output treesize:130 [2018-10-26 22:18:53,930 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2018-10-26 22:18:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:18:53,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:18:53,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-10-26 22:18:53,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 22:18:53,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 22:18:53,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=351, Unknown=2, NotChecked=0, Total=420 [2018-10-26 22:18:53,957 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 21 states. [2018-10-26 22:18:56,188 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2018-10-26 22:18:58,409 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2018-10-26 22:19:02,751 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2018-10-26 22:19:03,326 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 47 [2018-10-26 22:19:03,877 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 48 [2018-10-26 22:19:05,003 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 54 [2018-10-26 22:19:05,368 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-10-26 22:19:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:05,660 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-10-26 22:19:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:19:05,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-26 22:19:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:05,661 INFO L225 Difference]: With dead ends: 43 [2018-10-26 22:19:05,661 INFO L226 Difference]: Without dead ends: 35 [2018-10-26 22:19:05,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=135, Invalid=616, Unknown=5, NotChecked=0, Total=756 [2018-10-26 22:19:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-26 22:19:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-26 22:19:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 22:19:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-10-26 22:19:05,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2018-10-26 22:19:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:05,668 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-10-26 22:19:05,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 22:19:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-10-26 22:19:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 22:19:05,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:05,669 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:05,670 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:05,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash -532415725, now seen corresponding path program 2 times [2018-10-26 22:19:05,670 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:05,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:06,137 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-10-26 22:19:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:06,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:06,559 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:19:06,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:19:06,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:19:06,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:06,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:06,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-26 22:19:06,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:19:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:19:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:19:06,654 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-10-26 22:19:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:06,956 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-10-26 22:19:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:19:06,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-26 22:19:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:06,958 INFO L225 Difference]: With dead ends: 44 [2018-10-26 22:19:06,958 INFO L226 Difference]: Without dead ends: 35 [2018-10-26 22:19:06,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:19:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-26 22:19:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-26 22:19:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-26 22:19:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-26 22:19:06,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2018-10-26 22:19:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:06,965 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-26 22:19:06,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:19:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-26 22:19:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 22:19:06,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:06,966 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:06,967 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:06,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:06,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1097890827, now seen corresponding path program 3 times [2018-10-26 22:19:06,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:06,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:06,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:07,266 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-10-26 22:19:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:07,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:19:07,873 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:19:07,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:19:08,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:19:08,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:19:08,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:19:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:19:08,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:19:08,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-10-26 22:19:08,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:19:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:19:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:19:08,203 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2018-10-26 22:19:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:19:08,374 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-26 22:19:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 22:19:08,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-26 22:19:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:19:08,377 INFO L225 Difference]: With dead ends: 55 [2018-10-26 22:19:08,377 INFO L226 Difference]: Without dead ends: 46 [2018-10-26 22:19:08,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:19:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-26 22:19:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-10-26 22:19:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-26 22:19:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-26 22:19:08,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-10-26 22:19:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:19:08,385 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-26 22:19:08,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:19:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-26 22:19:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 22:19:08,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:19:08,386 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:19:08,387 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:19:08,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:19:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1777949197, now seen corresponding path program 3 times [2018-10-26 22:19:08,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:19:08,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:19:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:08,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:19:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:19:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:19:13,909 WARN L179 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 136 DAG size of output: 43 [2018-10-26 22:19:24,512 WARN L179 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 163 DAG size of output: 49 [2018-10-26 22:19:39,001 WARN L179 SmtUtils]: Spent 14.40 s on a formula simplification. DAG size of input: 192 DAG size of output: 57 [2018-10-26 22:19:49,906 WARN L179 SmtUtils]: Spent 10.87 s on a formula simplification. DAG size of input: 195 DAG size of output: 55 [2018-10-26 22:19:54,394 WARN L179 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 195 DAG size of output: 57 [2018-10-26 22:19:55,110 WARN L179 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 60 [2018-10-26 22:19:57,583 WARN L179 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 184 DAG size of output: 47 [2018-10-26 22:20:02,370 WARN L179 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 181 DAG size of output: 43 [2018-10-26 22:20:02,862 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 47 [2018-10-26 22:20:05,231 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 174 DAG size of output: 39 [2018-10-26 22:20:05,561 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 33 [2018-10-26 22:20:08,288 WARN L179 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 148 DAG size of output: 32 [2018-10-26 22:20:39,202 WARN L179 SmtUtils]: Spent 30.60 s on a formula simplification. DAG size of input: 167 DAG size of output: 48 [2018-10-26 22:20:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:39,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:20:39,490 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:20:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:20:57,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-26 22:20:57,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:20:57,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:20:57,673 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:20:57,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,680 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:20:57,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-10-26 22:20:57,689 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 16 treesize of output 15 [2018-10-26 22:20:57,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-10-26 22:20:57,727 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 16 treesize of output 15 [2018-10-26 22:20:57,728 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-10-26 22:20:57,780 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 16 treesize of output 15 [2018-10-26 22:20:57,780 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,807 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,809 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:20:57,810 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-10-26 22:20:57,818 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 16 treesize of output 15 [2018-10-26 22:20:57,818 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,890 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-10-26 22:20:57,900 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 16 treesize of output 15 [2018-10-26 22:20:57,900 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,931 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-10-26 22:20:57,941 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 16 treesize of output 15 [2018-10-26 22:20:57,941 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,970 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,971 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-26 22:20:57,971 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:57,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-10-26 22:20:57,980 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 16 treesize of output 15 [2018-10-26 22:20:57,980 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 22:20:58,001 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:20:58,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-10-26 22:20:58,010 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 16 treesize of output 15 [2018-10-26 22:20:58,011 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-26 22:21:00,043 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:21:06,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-26 22:21:06,364 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:1168, output treesize:193 [2018-10-26 22:21:06,579 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2018-10-26 22:21:06,837 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-26 22:21:07,028 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-26 22:21:09,929 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-10-26 22:21:10,461 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-26 22:21:11,408 WARN L179 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-26 22:21:12,132 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-26 22:21:13,356 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-10-26 22:21:17,833 WARN L179 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-10-26 22:21:17,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 103 [2018-10-26 22:21:17,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:17,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:17,864 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:17,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:17,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2018-10-26 22:21:17,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:21:17,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:21:18,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2018-10-26 22:21:18,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,172 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 157 [2018-10-26 22:21:18,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:21:18,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:21:18,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2018-10-26 22:21:18,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,689 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 177 [2018-10-26 22:21:18,706 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 22:21:18,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:21:18,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-10-26 22:21:18,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,838 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:21:18,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 177 [2018-10-26 22:21:18,849 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:21:18,918 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:21:19,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-26 22:21:19,031 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 10 variables, input treesize:425, output treesize:227 [2018-10-26 22:21:19,786 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-10-26 22:21:24,029 WARN L179 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2018-10-26 22:21:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:24,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:21:24,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-10-26 22:21:24,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 22:21:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 22:21:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=690, Unknown=1, NotChecked=0, Total=812 [2018-10-26 22:21:24,068 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 29 states. [2018-10-26 22:21:24,334 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-10-26 22:21:29,516 WARN L179 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-10-26 22:21:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:21:29,691 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-10-26 22:21:29,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:21:29,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2018-10-26 22:21:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:21:29,694 INFO L225 Difference]: With dead ends: 53 [2018-10-26 22:21:29,694 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 22:21:29,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 108.0s TimeCoverageRelationStatistics Valid=136, Invalid=793, Unknown=1, NotChecked=0, Total=930 [2018-10-26 22:21:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 22:21:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-26 22:21:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 22:21:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-10-26 22:21:29,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-10-26 22:21:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:21:29,714 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-10-26 22:21:29,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 22:21:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-10-26 22:21:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-26 22:21:29,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:21:29,715 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:21:29,715 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:21:29,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:21:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash -817506797, now seen corresponding path program 4 times [2018-10-26 22:21:29,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:21:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:21:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:21:29,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:21:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:21:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:35,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:21:35,308 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:21:35,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:21:35,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:21:35,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:21:35,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:21:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:21:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-10-26 22:21:35,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:21:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:21:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=126, Unknown=2, NotChecked=0, Total=156 [2018-10-26 22:21:35,463 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 13 states. [2018-10-26 22:21:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:21:35,641 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-10-26 22:21:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 22:21:35,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-26 22:21:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:21:35,642 INFO L225 Difference]: With dead ends: 54 [2018-10-26 22:21:35,642 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 22:21:35,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=28, Invalid=126, Unknown=2, NotChecked=0, Total=156 [2018-10-26 22:21:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 22:21:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-26 22:21:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 22:21:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-10-26 22:21:35,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-10-26 22:21:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:21:35,651 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-10-26 22:21:35,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:21:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-10-26 22:21:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 22:21:35,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:21:35,653 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:21:35,653 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:21:35,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:21:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1080000779, now seen corresponding path program 5 times [2018-10-26 22:21:35,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:21:35,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:21:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:21:35,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:21:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:21:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:40,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:21:40,810 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 22:21:40,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 22:21:41,127 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-26 22:21:41,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:21:41,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:21:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:41,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:21:41,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-10-26 22:21:41,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:21:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:21:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=176, Unknown=1, NotChecked=0, Total=210 [2018-10-26 22:21:41,234 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 15 states. [2018-10-26 22:21:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:21:41,693 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-26 22:21:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:21:41,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-26 22:21:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:21:41,695 INFO L225 Difference]: With dead ends: 65 [2018-10-26 22:21:41,695 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 22:21:41,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=33, Invalid=176, Unknown=1, NotChecked=0, Total=210 [2018-10-26 22:21:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 22:21:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2018-10-26 22:21:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 22:21:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-26 22:21:41,704 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-10-26 22:21:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:21:41,705 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-26 22:21:41,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:21:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-26 22:21:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 22:21:41,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:21:41,706 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:21:41,706 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:21:41,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:21:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1760059149, now seen corresponding path program 4 times [2018-10-26 22:21:41,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:21:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:21:41,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:21:41,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:21:41,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:21:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:48,644 WARN L179 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 127 DAG size of output: 43 [2018-10-26 22:21:54,992 WARN L179 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 159 DAG size of output: 49 [2018-10-26 22:21:55,829 WARN L179 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 62 [2018-10-26 22:22:02,334 WARN L179 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 195 DAG size of output: 62 [2018-10-26 22:22:02,899 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 63 [2018-10-26 22:22:05,695 WARN L179 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 218 DAG size of output: 65 [2018-10-26 22:22:08,592 WARN L179 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 56 [2018-10-26 22:22:11,632 WARN L179 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 200 DAG size of output: 52 [2018-10-26 22:22:13,717 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 5 c_ULTIMATE.start_linear_search_~j~0))) (and (let ((.cse41 (div c_~SIZE~0 4294967296))) (let ((.cse0 (* 4294967296 .cse41))) (or (<= (+ c_ULTIMATE.start_linear_search_~j~0 .cse0 2147483643) c_~SIZE~0) (let ((.cse9 (div c_ULTIMATE.start_linear_search_~n 4294967296))) (let ((.cse16 (* 4294967296 .cse9))) (let ((.cse15 (+ c_ULTIMATE.start_linear_search_~n .cse0)) (.cse42 (+ .cse16 5))) (let ((.cse3 (< .cse42 c_ULTIMATE.start_linear_search_~n)) (.cse1 (= c_~SIZE~0 .cse15))) (and .cse1 (or .cse2 .cse3) (let ((.cse14 (<= c_ULTIMATE.start_linear_search_~n .cse42))) (or (let ((.cse40 (* 2147483648 .cse41)) (.cse30 (div (+ c_~SIZE~0 (* (- 4294967296) .cse41)) 2))) (let ((.cse5 (+ .cse40 .cse30)) (.cse6 (+ .cse40 .cse30 1)) (.cse4 (div c_~SIZE~0 2))) (and (or (<= .cse4 .cse5) (< .cse4 .cse6)) (let ((.cse35 (= c_~SIZE~0 (+ c_ULTIMATE.start_linear_search_~n .cse0 4294967296)))) (or (let ((.cse8 (* 2 .cse4))) (let ((.cse36 (<= .cse0 c_~SIZE~0)) (.cse37 (= c_~SIZE~0 .cse8))) (let ((.cse31 (+ .cse0 2147483647)) (.cse24 (not .cse37)) (.cse25 (div (+ .cse30 1) 4294967296)) (.cse26 (< c_~SIZE~0 .cse0)) (.cse17 (div .cse30 4294967296)) (.cse23 (or .cse36 .cse37)) (.cse32 (not .cse35))) (and (let ((.cse38 (and .cse24 .cse26))) (or (let ((.cse33 (+ .cse25 1)) (.cse34 (+ .cse17 1))) (and (or (and (let ((.cse13 (- c_ULTIMATE.start_linear_search_~j~0))) (or (let ((.cse7 (div (+ c_ULTIMATE.start_linear_search_~j~0 (- 5)) 4294967296))) (and (or .cse3 (<= 0 .cse7)) .cse1 (or (let ((.cse11 (* 4294967296 0)) (.cse12 (* 4294967296 .cse7))) (and (or (<= (+ .cse8 1) c_~SIZE~0) (< .cse8 c_~SIZE~0)) (or (<= c_~SIZE~0 .cse8) (<= c_ULTIMATE.start_linear_search_~j~0 (+ (* 2 (div (let ((.cse10 (- c_~SIZE~0))) (+ (* (- 4294967296) (div (+ (* (- 4294967296) .cse9) (+ c_ULTIMATE.start_linear_search_~n (+ .cse0 (+ .cse10 .cse11)))) 4294967296)) (+ .cse8 (+ .cse10 (+ .cse12 1))))) 2)) 5))) (<= (+ c_~SIZE~0 (* 4294967296 (div (+ .cse13 (+ .cse11 4294967300)) 4294967296))) (+ .cse12 .cse0 2147483647)))) .cse14))) (and (<= .cse5 .cse4) (or (< .cse4 .cse5) (and (let ((.cse18 (* (- 2) c_ULTIMATE.start_linear_search_~j~0)) (.cse19 (* (- 4) .cse4)) (.cse20 (* (- 1) c_ULTIMATE.start_linear_search_~a.offset)) (.cse21 (* 2 c_~SIZE~0)) (.cse22 (* 4 .cse30)) (.cse27 (* 4 .cse4)) (.cse28 (* (- 2) c_~SIZE~0)) (.cse29 (* (- 4) .cse30))) (or (and (<= .cse15 (+ .cse16 (* 4294967296 (div (+ (* (- 17179869184) .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 (- 3)) 8589934592)) c_~SIZE~0 4294967295)) .cse23) (and .cse24 (<= .cse15 (+ .cse16 (* 4294967296 (div (+ (* (- 17179869184) .cse25) .cse18 .cse19 .cse20 .cse21 .cse22 (- 3)) 8589934592)) c_~SIZE~0 4294967295)) .cse26) (and .cse24 (<= .cse15 (+ .cse16 c_~SIZE~0 (* 4294967296 (div (+ (* 17179869184 .cse25) .cse27 c_ULTIMATE.start_linear_search_~a.offset .cse28 .cse29 11) 8589934592)) 4294967295)) .cse26) (and .cse23 (<= .cse15 (+ (* 4294967296 (div (+ (* 17179869184 .cse17) .cse27 c_ULTIMATE.start_linear_search_~a.offset .cse28 .cse29 11) 8589934592)) .cse16 c_~SIZE~0 4294967295))))) (<= (+ (* 4294967296 (div (+ .cse13 4294967300) 4294967296)) c_~SIZE~0) .cse31)))))) .cse32) (and .cse24 (<= .cse33 0) .cse26) (and .cse23 (<= .cse34 0)) .cse35) (or (and (<= 0 .cse17) .cse23) (and .cse24 (<= 0 .cse25) .cse26) (and (or .cse36 (< 0 .cse33) .cse37) (or .cse38 (< 0 .cse34)))) (= c_ULTIMATE.start_linear_search_~a.offset 0))) (and (or (< 0 .cse25) .cse36 .cse37) (or .cse38 (< 0 .cse17))))) (or (and .cse24 (<= .cse25 0) .cse26) (and (<= .cse17 0) .cse23) (and (<= c_~SIZE~0 .cse31) (let ((.cse39 (+ c_~SIZE~0 5))) (or (and .cse24 (<= (+ (* 8589934592 .cse25) c_ULTIMATE.start_linear_search_~j~0 .cse0) .cse39) .cse26) (and (<= (+ (* 8589934592 .cse17) c_ULTIMATE.start_linear_search_~j~0 .cse0) .cse39) .cse23))))) .cse32)))) (<= .cse6 .cse4) .cse35))))) .cse14)))))))))) .cse2 (<= c_ULTIMATE.start_linear_search_~j~0 5))) is different from false [2018-10-26 22:22:14,169 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 49 [2018-10-26 22:22:18,601 WARN L179 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 185 DAG size of output: 48 [2018-10-26 22:22:21,196 WARN L179 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 170 DAG size of output: 34 [2018-10-26 22:22:23,573 WARN L179 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 151 DAG size of output: 33 Received shutdown request... [2018-10-26 22:22:36,092 WARN L187 SmtUtils]: Removed 3 from assertion stack [2018-10-26 22:22:36,092 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 22:22:36,096 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 22:22:36,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:22:36 BoogieIcfgContainer [2018-10-26 22:22:36,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:22:36,098 INFO L168 Benchmark]: Toolchain (without parser) took 273764.81 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 1.8 GB in the end (delta: -367.9 MB). Peak memory consumption was 711.1 MB. Max. memory is 7.1 GB. [2018-10-26 22:22:36,098 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 22:22:36,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.00 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-10-26 22:22:36,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.14 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-10-26 22:22:36,099 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 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-10-26 22:22:36,099 INFO L168 Benchmark]: RCFGBuilder took 592.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-10-26 22:22:36,101 INFO L168 Benchmark]: TraceAbstraction took 272807.03 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 314.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 416.7 MB). Peak memory consumption was 731.3 MB. Max. memory is 7.1 GB. [2018-10-26 22:22:36,104 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.00 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 52.14 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 30.04 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 592.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 272807.03 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 314.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 416.7 MB). Peak memory consumption was 731.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 162. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. TIMEOUT Result, 272.7s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 191 SDtfs, 238 SDslu, 745 SDs, 0 SdLazy, 1525 SolverSat, 82 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 200 SyntacticMatches, 30 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 176.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=15, 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, 15 MinimizatonAttempts, 70 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 19.2s SatisfiabilityAnalysisTime, 164.5s InterpolantComputationTime, 557 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 532 ConstructedInterpolants, 38 QuantifiedInterpolants, 308229 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1261 ConjunctsInSsa, 283 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 183/678 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown