java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:01:53,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:01:53,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:01:53,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:01:53,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:01:53,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:01:53,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:01:53,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:01:53,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:01:53,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:01:53,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:01:53,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:01:53,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:01:53,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:01:53,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:01:53,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:01:53,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:01:53,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:01:53,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:01:53,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:01:53,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:01:53,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:01:53,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:01:53,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:01:53,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:01:53,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:01:53,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:01:53,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:01:53,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:01:53,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:01:53,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:01:53,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:01:53,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:01:53,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:01:53,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:01:53,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:01:53,503 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:01:53,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:01:53,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:01:53,531 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:01:53,531 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:01:53,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:01:53,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:01:53,532 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:01:53,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:01:53,533 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:01:53,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:01:53,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:01:53,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:01:53,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:01:53,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:01:53,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:01:53,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:01:53,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:01:53,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:01:53,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:01:53,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:01:53,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:01:53,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:01:53,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:01:53,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:01:53,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:01:53,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:01:53,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:01:53,541 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:01:53,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:01:53,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:01:53,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:01:53,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:01:53,629 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:01:53,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-11-06 21:01:53,698 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0df1c52/2a8cf54c7e3a423488702e035c0d8b0b/FLAG120bef132 [2018-11-06 21:01:54,244 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:01:54,249 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label56_true-unreach-call.c [2018-11-06 21:01:54,265 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0df1c52/2a8cf54c7e3a423488702e035c0d8b0b/FLAG120bef132 [2018-11-06 21:01:54,281 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d0df1c52/2a8cf54c7e3a423488702e035c0d8b0b [2018-11-06 21:01:54,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:01:54,299 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:01:54,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:01:54,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:01:54,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:01:54,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:54" (1/1) ... [2018-11-06 21:01:54,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c050c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:54, skipping insertion in model container [2018-11-06 21:01:54,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:54" (1/1) ... [2018-11-06 21:01:54,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:01:54,394 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:01:54,922 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:01:54,931 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:01:55,072 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:01:55,096 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:01:55,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55 WrapperNode [2018-11-06 21:01:55,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:01:55,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:01:55,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:01:55,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:01:55,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:01:55,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:01:55,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:01:55,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:01:55,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... [2018-11-06 21:01:55,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:01:55,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:01:55,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:01:55,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:01:55,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:01:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:01:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:01:55,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:01:58,570 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:01:58,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:58 BoogieIcfgContainer [2018-11-06 21:01:58,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:01:58,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:01:58,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:01:58,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:01:58,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:54" (1/3) ... [2018-11-06 21:01:58,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b2f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:58, skipping insertion in model container [2018-11-06 21:01:58,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:55" (2/3) ... [2018-11-06 21:01:58,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b2f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:58, skipping insertion in model container [2018-11-06 21:01:58,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:58" (3/3) ... [2018-11-06 21:01:58,585 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label56_true-unreach-call.c [2018-11-06 21:01:58,598 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:01:58,615 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:01:58,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:01:58,679 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:01:58,680 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:01:58,680 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:01:58,680 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:01:58,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:01:58,681 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:01:58,681 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:01:58,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:01:58,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:01:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-11-06 21:01:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-06 21:01:58,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:01:58,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:01:58,718 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:01:58,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:01:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1155896462, now seen corresponding path program 1 times [2018-11-06 21:01:58,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:01:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:01:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:01:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:01:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:01:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:01:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:01:59,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:01:59,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:01:59,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:01:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:01:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:01:59,180 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-11-06 21:02:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:01,345 INFO L93 Difference]: Finished difference Result 698 states and 1250 transitions. [2018-11-06 21:02:01,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:01,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-06 21:02:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:01,368 INFO L225 Difference]: With dead ends: 698 [2018-11-06 21:02:01,369 INFO L226 Difference]: Without dead ends: 484 [2018-11-06 21:02:01,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-11-06 21:02:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2018-11-06 21:02:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-06 21:02:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 811 transitions. [2018-11-06 21:02:01,454 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 811 transitions. Word has length 24 [2018-11-06 21:02:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:01,455 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 811 transitions. [2018-11-06 21:02:01,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 811 transitions. [2018-11-06 21:02:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-06 21:02:01,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:01,460 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:01,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:01,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:01,461 INFO L82 PathProgramCache]: Analyzing trace with hash -47374565, now seen corresponding path program 1 times [2018-11-06 21:02:01,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:01,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:01,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:01,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:01,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:01,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:01,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:01,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:01,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:01,783 INFO L87 Difference]: Start difference. First operand 484 states and 811 transitions. Second operand 4 states. [2018-11-06 21:02:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:03,401 INFO L93 Difference]: Finished difference Result 1106 states and 1836 transitions. [2018-11-06 21:02:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:03,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-06 21:02:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:03,408 INFO L225 Difference]: With dead ends: 1106 [2018-11-06 21:02:03,408 INFO L226 Difference]: Without dead ends: 624 [2018-11-06 21:02:03,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-06 21:02:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2018-11-06 21:02:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-06 21:02:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 952 transitions. [2018-11-06 21:02:03,444 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 952 transitions. Word has length 94 [2018-11-06 21:02:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:03,445 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 952 transitions. [2018-11-06 21:02:03,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 952 transitions. [2018-11-06 21:02:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-06 21:02:03,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:03,448 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:03,448 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:03,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1289860076, now seen corresponding path program 1 times [2018-11-06 21:02:03,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:03,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:03,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:03,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:03,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:03,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:03,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:03,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:03,649 INFO L87 Difference]: Start difference. First operand 624 states and 952 transitions. Second operand 4 states. [2018-11-06 21:02:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:07,539 INFO L93 Difference]: Finished difference Result 2226 states and 3464 transitions. [2018-11-06 21:02:07,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:07,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-06 21:02:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:07,549 INFO L225 Difference]: With dead ends: 2226 [2018-11-06 21:02:07,549 INFO L226 Difference]: Without dead ends: 1604 [2018-11-06 21:02:07,551 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-11-06 21:02:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-11-06 21:02:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-06 21:02:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2225 transitions. [2018-11-06 21:02:07,590 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2225 transitions. Word has length 100 [2018-11-06 21:02:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:07,590 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2225 transitions. [2018-11-06 21:02:07,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2225 transitions. [2018-11-06 21:02:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-06 21:02:07,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:07,599 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:07,599 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:07,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -525084239, now seen corresponding path program 1 times [2018-11-06 21:02:07,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:07,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:07,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:07,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:07,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:08,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:08,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:08,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:08,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:08,062 INFO L87 Difference]: Start difference. First operand 1604 states and 2225 transitions. Second operand 4 states. [2018-11-06 21:02:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:10,306 INFO L93 Difference]: Finished difference Result 3626 states and 5071 transitions. [2018-11-06 21:02:10,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:10,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-11-06 21:02:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:10,317 INFO L225 Difference]: With dead ends: 3626 [2018-11-06 21:02:10,318 INFO L226 Difference]: Without dead ends: 2024 [2018-11-06 21:02:10,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-11-06 21:02:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024. [2018-11-06 21:02:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2018-11-06 21:02:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2553 transitions. [2018-11-06 21:02:10,357 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2553 transitions. Word has length 162 [2018-11-06 21:02:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:10,357 INFO L480 AbstractCegarLoop]: Abstraction has 2024 states and 2553 transitions. [2018-11-06 21:02:10,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2553 transitions. [2018-11-06 21:02:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-06 21:02:10,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:10,362 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:10,363 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:10,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 642992039, now seen corresponding path program 1 times [2018-11-06 21:02:10,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-06 21:02:10,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:10,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:10,796 INFO L87 Difference]: Start difference. First operand 2024 states and 2553 transitions. Second operand 5 states. [2018-11-06 21:02:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:14,518 INFO L93 Difference]: Finished difference Result 7422 states and 9403 transitions. [2018-11-06 21:02:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:14,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-11-06 21:02:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:14,543 INFO L225 Difference]: With dead ends: 7422 [2018-11-06 21:02:14,544 INFO L226 Difference]: Without dead ends: 5400 [2018-11-06 21:02:14,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5400 states. [2018-11-06 21:02:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5400 to 3984. [2018-11-06 21:02:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3984 states. [2018-11-06 21:02:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4803 transitions. [2018-11-06 21:02:14,639 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4803 transitions. Word has length 195 [2018-11-06 21:02:14,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:14,640 INFO L480 AbstractCegarLoop]: Abstraction has 3984 states and 4803 transitions. [2018-11-06 21:02:14,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4803 transitions. [2018-11-06 21:02:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-06 21:02:14,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:14,650 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:14,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:14,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:14,653 INFO L82 PathProgramCache]: Analyzing trace with hash -150687317, now seen corresponding path program 1 times [2018-11-06 21:02:14,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:14,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:14,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:14,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:15,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:15,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:02:15,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:15,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:15,143 INFO L87 Difference]: Start difference. First operand 3984 states and 4803 transitions. Second operand 5 states. [2018-11-06 21:02:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:16,588 INFO L93 Difference]: Finished difference Result 7826 states and 9459 transitions. [2018-11-06 21:02:16,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:16,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2018-11-06 21:02:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:16,598 INFO L225 Difference]: With dead ends: 7826 [2018-11-06 21:02:16,598 INFO L226 Difference]: Without dead ends: 1968 [2018-11-06 21:02:16,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-11-06 21:02:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1828. [2018-11-06 21:02:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2018-11-06 21:02:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 1996 transitions. [2018-11-06 21:02:16,638 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 1996 transitions. Word has length 238 [2018-11-06 21:02:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:16,638 INFO L480 AbstractCegarLoop]: Abstraction has 1828 states and 1996 transitions. [2018-11-06 21:02:16,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 1996 transitions. [2018-11-06 21:02:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-06 21:02:16,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:16,645 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:16,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:16,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash -110008198, now seen corresponding path program 1 times [2018-11-06 21:02:16,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:16,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:17,240 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:02:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-06 21:02:17,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:17,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:17,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:17,406 INFO L87 Difference]: Start difference. First operand 1828 states and 1996 transitions. Second operand 5 states. [2018-11-06 21:02:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:18,661 INFO L93 Difference]: Finished difference Result 3654 states and 3990 transitions. [2018-11-06 21:02:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:18,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2018-11-06 21:02:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:18,670 INFO L225 Difference]: With dead ends: 3654 [2018-11-06 21:02:18,671 INFO L226 Difference]: Without dead ends: 1827 [2018-11-06 21:02:18,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2018-11-06 21:02:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1827. [2018-11-06 21:02:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-11-06 21:02:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 1954 transitions. [2018-11-06 21:02:18,702 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 1954 transitions. Word has length 262 [2018-11-06 21:02:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:18,702 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 1954 transitions. [2018-11-06 21:02:18,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 1954 transitions. [2018-11-06 21:02:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-06 21:02:18,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:18,708 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:18,708 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:18,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1440191249, now seen corresponding path program 1 times [2018-11-06 21:02:18,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:18,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:18,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:19,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:19,398 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:02:19,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:19,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:20,279 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-11-06 21:02:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:20,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:20,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-06 21:02:20,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:02:20,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:02:20,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:02:20,597 INFO L87 Difference]: Start difference. First operand 1827 states and 1954 transitions. Second operand 7 states. [2018-11-06 21:02:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:25,391 INFO L93 Difference]: Finished difference Result 5894 states and 6367 transitions. [2018-11-06 21:02:25,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:02:25,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2018-11-06 21:02:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:25,408 INFO L225 Difference]: With dead ends: 5894 [2018-11-06 21:02:25,408 INFO L226 Difference]: Without dead ends: 3927 [2018-11-06 21:02:25,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:02:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2018-11-06 21:02:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 2946. [2018-11-06 21:02:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2018-11-06 21:02:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3170 transitions. [2018-11-06 21:02:25,470 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3170 transitions. Word has length 274 [2018-11-06 21:02:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:25,471 INFO L480 AbstractCegarLoop]: Abstraction has 2946 states and 3170 transitions. [2018-11-06 21:02:25,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:02:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3170 transitions. [2018-11-06 21:02:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-06 21:02:25,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:25,480 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:25,480 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:25,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:25,481 INFO L82 PathProgramCache]: Analyzing trace with hash 856611996, now seen corresponding path program 1 times [2018-11-06 21:02:25,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:25,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:25,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:25,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:25,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 223 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 21:02:26,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:26,078 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:02:26,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:26,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 223 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-06 21:02:26,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:26,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-11-06 21:02:26,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:02:26,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:02:26,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:26,419 INFO L87 Difference]: Start difference. First operand 2946 states and 3170 transitions. Second operand 5 states. [2018-11-06 21:02:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:27,978 INFO L93 Difference]: Finished difference Result 7011 states and 7544 transitions. [2018-11-06 21:02:27,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:02:27,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 329 [2018-11-06 21:02:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:27,993 INFO L225 Difference]: With dead ends: 7011 [2018-11-06 21:02:27,993 INFO L226 Difference]: Without dead ends: 3925 [2018-11-06 21:02:27,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:02:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-11-06 21:02:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3505. [2018-11-06 21:02:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-11-06 21:02:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3716 transitions. [2018-11-06 21:02:28,055 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3716 transitions. Word has length 329 [2018-11-06 21:02:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:28,056 INFO L480 AbstractCegarLoop]: Abstraction has 3505 states and 3716 transitions. [2018-11-06 21:02:28,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:02:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3716 transitions. [2018-11-06 21:02:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-11-06 21:02:28,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:28,068 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:28,068 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:28,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1964512189, now seen corresponding path program 1 times [2018-11-06 21:02:28,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:28,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:28,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:28,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-06 21:02:28,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:28,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:28,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:28,557 INFO L87 Difference]: Start difference. First operand 3505 states and 3716 transitions. Second operand 4 states. [2018-11-06 21:02:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:31,102 INFO L93 Difference]: Finished difference Result 7428 states and 7898 transitions. [2018-11-06 21:02:31,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:31,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2018-11-06 21:02:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:31,113 INFO L225 Difference]: With dead ends: 7428 [2018-11-06 21:02:31,114 INFO L226 Difference]: Without dead ends: 4065 [2018-11-06 21:02:31,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2018-11-06 21:02:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3925. [2018-11-06 21:02:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3925 states. [2018-11-06 21:02:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4154 transitions. [2018-11-06 21:02:31,179 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4154 transitions. Word has length 415 [2018-11-06 21:02:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:31,179 INFO L480 AbstractCegarLoop]: Abstraction has 3925 states and 4154 transitions. [2018-11-06 21:02:31,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4154 transitions. [2018-11-06 21:02:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-11-06 21:02:31,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:31,193 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:31,193 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:31,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash -831427639, now seen corresponding path program 1 times [2018-11-06 21:02:31,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:31,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 48 proven. 449 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-06 21:02:31,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:31,998 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:02:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:32,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:32,509 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 17 [2018-11-06 21:02:33,831 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 70 DAG size of output: 27 [2018-11-06 21:02:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 171 proven. 326 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-06 21:02:34,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:34,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-11-06 21:02:34,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:02:34,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:02:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:02:34,526 INFO L87 Difference]: Start difference. First operand 3925 states and 4154 transitions. Second operand 13 states. [2018-11-06 21:02:34,750 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-06 21:03:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:11,179 INFO L93 Difference]: Finished difference Result 10556 states and 11171 transitions. [2018-11-06 21:03:11,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-06 21:03:11,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 424 [2018-11-06 21:03:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:11,208 INFO L225 Difference]: With dead ends: 10556 [2018-11-06 21:03:11,208 INFO L226 Difference]: Without dead ends: 6492 [2018-11-06 21:03:11,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=326, Invalid=730, Unknown=0, NotChecked=0, Total=1056 [2018-11-06 21:03:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2018-11-06 21:03:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 3784. [2018-11-06 21:03:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-11-06 21:03:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 4007 transitions. [2018-11-06 21:03:11,294 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 4007 transitions. Word has length 424 [2018-11-06 21:03:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:11,295 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 4007 transitions. [2018-11-06 21:03:11,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:03:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 4007 transitions. [2018-11-06 21:03:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-11-06 21:03:11,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:11,315 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:11,315 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:11,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2104286675, now seen corresponding path program 1 times [2018-11-06 21:03:11,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 571 proven. 110 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-06 21:03:12,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:12,180 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:12,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:12,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:12,678 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-11-06 21:03:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-06 21:03:12,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:03:12,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-06 21:03:12,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:03:12,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:03:12,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:03:12,994 INFO L87 Difference]: Start difference. First operand 3784 states and 4007 transitions. Second operand 8 states. [2018-11-06 21:03:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:16,372 INFO L93 Difference]: Finished difference Result 10226 states and 10829 transitions. [2018-11-06 21:03:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:03:16,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 538 [2018-11-06 21:03:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:16,388 INFO L225 Difference]: With dead ends: 10226 [2018-11-06 21:03:16,388 INFO L226 Difference]: Without dead ends: 6304 [2018-11-06 21:03:16,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:03:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2018-11-06 21:03:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 3924. [2018-11-06 21:03:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3924 states. [2018-11-06 21:03:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 4155 transitions. [2018-11-06 21:03:16,482 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 4155 transitions. Word has length 538 [2018-11-06 21:03:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:16,483 INFO L480 AbstractCegarLoop]: Abstraction has 3924 states and 4155 transitions. [2018-11-06 21:03:16,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:03:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 4155 transitions. [2018-11-06 21:03:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-11-06 21:03:16,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:16,542 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:16,542 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:16,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:16,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1016352259, now seen corresponding path program 1 times [2018-11-06 21:03:16,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:16,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:16,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:16,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:16,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:17,511 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-06 21:03:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 697 proven. 228 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-11-06 21:03:18,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:18,047 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:03:18,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:18,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-11-06 21:03:18,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:03:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 21:03:18,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:03:18,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:03:18,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:03:18,425 INFO L87 Difference]: Start difference. First operand 3924 states and 4155 transitions. Second operand 11 states. [2018-11-06 21:03:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:20,634 INFO L93 Difference]: Finished difference Result 6811 states and 7208 transitions. [2018-11-06 21:03:20,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:03:20,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 568 [2018-11-06 21:03:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:20,635 INFO L225 Difference]: With dead ends: 6811 [2018-11-06 21:03:20,635 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:03:20,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 575 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-11-06 21:03:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:03:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:03:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:03:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:03:20,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 568 [2018-11-06 21:03:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:20,641 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:03:20,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:03:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:03:20,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:03:20,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:03:20,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:20,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,035 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 269 [2018-11-06 21:03:21,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:03:21,401 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 269 [2018-11-06 21:03:26,616 WARN L179 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 260 DAG size of output: 83 [2018-11-06 21:03:29,324 WARN L179 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 260 DAG size of output: 83 [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,328 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-06 21:03:29,329 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-06 21:03:29,330 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-06 21:03:29,331 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-06 21:03:29,332 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-06 21:03:29,333 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L421 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse15 (= ~a10~0 4)) (.cse6 (= ~a10~0 1)) (.cse19 (+ ~a1~0 13))) (let ((.cse2 (= ~a12~0 0)) (.cse7 (<= .cse19 0)) (.cse3 (= ~a4~0 14)) (.cse16 (<= ~a1~0 218)) (.cse11 (= ~a19~0 9)) (.cse18 (not .cse6)) (.cse17 (not .cse15))) (let ((.cse1 (< 38 ~a1~0)) (.cse0 (= ~a10~0 3)) (.cse13 (<= ~a1~0 12)) (.cse4 (and .cse16 .cse11 (< 0 .cse19) .cse18 .cse17)) (.cse12 (= ~a10~0 0)) (.cse8 (= ~a19~0 8)) (.cse9 (< 218 ~a1~0)) (.cse14 (= ~a10~0 2)) (.cse5 (and .cse11 .cse2 .cse18 .cse7 .cse3 .cse17))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 .cse5) (and .cse6 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse8 .cse3) (and .cse9 (<= ~a1~0 589891) .cse6 .cse2 .cse3) (and .cse6 .cse2 (<= 56 ~a1~0) .cse3 (exists ((v_prenex_41 Int)) (let ((.cse10 (* 5 (div v_prenex_41 5)))) (and (<= v_prenex_41 218) (<= 0 .cse10) (<= ~a1~0 (+ (div .cse10 5) 505228)) (= 0 (mod v_prenex_41 5)))))) (and .cse11 .cse12 .cse2 .cse3) (and .cse0 .cse2 .cse13 .cse3 .cse4) (and .cse0 .cse9 .cse11 .cse2 .cse3 (<= ~a1~0 589865)) (and .cse6 .cse2 .cse13 (not .cse11) .cse3) (and (not .cse8) (<= ~a19~0 8)) (and .cse2 .cse8 .cse7 .cse3) (and .cse14 .cse2 .cse13 .cse3 .cse4) (and (<= ~a1~0 505232) .cse11 .cse15 .cse2 .cse3) (and .cse16 (and .cse12 .cse2 .cse3)) (and .cse8 .cse17) (and .cse9 .cse14 .cse11 .cse2 .cse3) (and .cse14 .cse5))))) [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-06 21:03:29,334 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-06 21:03:29,335 INFO L428 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-06 21:03:29,336 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 21:03:29,337 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse15 (= ~a10~0 4)) (.cse6 (= ~a10~0 1)) (.cse19 (+ ~a1~0 13))) (let ((.cse2 (= ~a12~0 0)) (.cse7 (<= .cse19 0)) (.cse3 (= ~a4~0 14)) (.cse16 (<= ~a1~0 218)) (.cse11 (= ~a19~0 9)) (.cse18 (not .cse6)) (.cse17 (not .cse15))) (let ((.cse1 (< 38 ~a1~0)) (.cse0 (= ~a10~0 3)) (.cse13 (<= ~a1~0 12)) (.cse4 (and .cse16 .cse11 (< 0 .cse19) .cse18 .cse17)) (.cse12 (= ~a10~0 0)) (.cse8 (= ~a19~0 8)) (.cse9 (< 218 ~a1~0)) (.cse14 (= ~a10~0 2)) (.cse5 (and .cse11 .cse2 .cse18 .cse7 .cse3 .cse17))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4)) (and .cse0 .cse5) (and .cse6 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse8 .cse3) (and .cse9 (<= ~a1~0 589891) .cse6 .cse2 .cse3) (and .cse6 .cse2 (<= 56 ~a1~0) .cse3 (exists ((v_prenex_41 Int)) (let ((.cse10 (* 5 (div v_prenex_41 5)))) (and (<= v_prenex_41 218) (<= 0 .cse10) (<= ~a1~0 (+ (div .cse10 5) 505228)) (= 0 (mod v_prenex_41 5)))))) (and .cse11 .cse12 .cse2 .cse3) (and .cse0 .cse2 .cse13 .cse3 .cse4) (and .cse0 .cse9 .cse11 .cse2 .cse3 (<= ~a1~0 589865)) (and .cse6 .cse2 .cse13 (not .cse11) .cse3) (and (not .cse8) (<= ~a19~0 8)) (and .cse2 .cse8 .cse7 .cse3) (and .cse14 .cse2 .cse13 .cse3 .cse4) (and (<= ~a1~0 505232) .cse11 .cse15 .cse2 .cse3) (and .cse16 (and .cse12 .cse2 .cse3)) (and .cse8 .cse17) (and .cse9 .cse14 .cse11 .cse2 .cse3) (and .cse14 .cse5))))) [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-06 21:03:29,338 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-06 21:03:29,339 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-06 21:03:29,340 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-06 21:03:29,341 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-06 21:03:29,342 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,343 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-06 21:03:29,344 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-06 21:03:29,345 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-06 21:03:29,346 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-06 21:03:29,355 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,356 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,356 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,357 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,375 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,376 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:03:29 BoogieIcfgContainer [2018-11-06 21:03:29,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:03:29,386 INFO L168 Benchmark]: Toolchain (without parser) took 95090.48 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -530.1 MB). Peak memory consumption was 979.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:03:29,387 INFO L168 Benchmark]: CDTParser took 0.25 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-11-06 21:03:29,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.66 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:03:29,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:03:29,390 INFO L168 Benchmark]: Boogie Preprocessor took 117.54 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:03:29,390 INFO L168 Benchmark]: RCFGBuilder took 3171.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.6 MB). Peak memory consumption was 131.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:03:29,391 INFO L168 Benchmark]: TraceAbstraction took 90811.46 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 768.1 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 123.8 MB). Peak memory consumption was 891.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:03:29,396 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.25 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 796.66 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 185.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.54 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3171.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.6 MB). Peak memory consumption was 131.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90811.46 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 768.1 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 123.8 MB). Peak memory consumption was 891.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 73]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2018-11-06 21:03:29,407 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,408 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,411 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,411 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,411 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,412 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] Derived loop invariant: (((((((((((((((((a10 == 3 && ((38 < a1 && a12 == 0) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4)) || (a10 == 3 && ((((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14) && !(a10 == 4))) || (((a10 == 1 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && 56 <= a1) && a4 == 14) && (\exists v_prenex_41 : int :: ((v_prenex_41 <= 218 && 0 <= 5 * (v_prenex_41 / 5)) && a1 <= 5 * (v_prenex_41 / 5) / 5 + 505228) && 0 == v_prenex_41 % 5))) || (((a19 == 9 && a10 == 0) && a12 == 0) && a4 == 14)) || ((((a10 == 3 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14)) || (!(a19 == 8) && a19 <= 8)) || (((a12 == 0 && a19 == 8) && a1 + 13 <= 0) && a4 == 14)) || ((((a10 == 2 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || ((((a1 <= 505232 && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14)) || (a1 <= 218 && (a10 == 0 && a12 == 0) && a4 == 14)) || (a19 == 8 && !(a10 == 4))) || ((((218 < a1 && a10 == 2) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 2 && ((((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14) && !(a10 == 4)) - InvariantResult [Line: 20]: Loop Invariant [2018-11-06 21:03:29,414 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,415 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] [2018-11-06 21:03:29,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_41,QUANTIFIED] Derived loop invariant: (((((((((((((((((a10 == 3 && ((38 < a1 && a12 == 0) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4)) || (a10 == 3 && ((((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14) && !(a10 == 4))) || (((a10 == 1 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && 56 <= a1) && a4 == 14) && (\exists v_prenex_41 : int :: ((v_prenex_41 <= 218 && 0 <= 5 * (v_prenex_41 / 5)) && a1 <= 5 * (v_prenex_41 / 5) / 5 + 505228) && 0 == v_prenex_41 % 5))) || (((a19 == 9 && a10 == 0) && a12 == 0) && a4 == 14)) || ((((a10 == 3 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14)) || (!(a19 == 8) && a19 <= 8)) || (((a12 == 0 && a19 == 8) && a1 + 13 <= 0) && a4 == 14)) || ((((a10 == 2 && a12 == 0) && a1 <= 12) && a4 == 14) && (((a1 <= 218 && a19 == 9) && 0 < a1 + 13) && !(a10 == 1)) && !(a10 == 4))) || ((((a1 <= 505232 && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14)) || (a1 <= 218 && (a10 == 0 && a12 == 0) && a4 == 14)) || (a19 == 8 && !(a10 == 4))) || ((((218 < a1 && a10 == 2) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 2 && ((((a19 == 9 && a12 == 0) && !(a10 == 1)) && a1 + 13 <= 0) && a4 == 14) && !(a10 == 4)) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. SAFE Result, 90.6s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 67.7s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1308 SDtfs, 6821 SDslu, 801 SDs, 0 SdLazy, 16007 SolverSat, 2347 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 61.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2234 GetRequests, 2143 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3984occurred in iteration=5, 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 8185 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 137 NumberOfFragments, 733 HoareAnnotationTreeSize, 3 FomulaSimplifications, 42854 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 37174 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 5756 NumberOfCodeBlocks, 5756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5738 ConstructedInterpolants, 204 QuantifiedInterpolants, 11769952 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2816 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 5918/7339 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...