/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:13:52,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:13:52,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:13:52,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:13:52,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:13:52,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:13:52,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:13:52,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:13:52,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:13:52,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:13:52,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:13:52,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:13:52,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:13:52,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:13:52,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:13:52,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:13:52,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:13:52,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:13:52,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:13:52,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:13:52,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:13:52,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:13:52,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:13:52,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:13:52,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:13:52,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:13:52,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:13:52,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:13:52,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:13:52,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:13:52,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:13:52,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:13:52,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:13:52,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:13:52,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:13:52,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:13:52,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:13:52,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:13:52,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:13:52,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:13:52,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:13:52,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:13:52,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:13:52,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:13:52,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:13:52,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:13:52,396 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:13:52,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:13:52,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:13:52,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:13:52,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:13:52,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:13:52,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:13:52,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:13:52,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:13:52,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:13:52,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:13:52,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:13:52,400 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:13:52,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:13:52,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:13:52,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:13:52,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:13:52,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:13:52,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:13:52,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:13:52,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:13:52,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:13:52,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:13:52,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:13:52,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:13:52,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:13:52,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:13:52,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:13:52,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:13:52,714 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:13:52,715 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:13:52,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59.c [2019-11-23 21:13:52,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056bc6a1d/ed548048af014f258254f0eb3c2fba6f/FLAG093524a70 [2019-11-23 21:13:53,389 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:13:53,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label59.c [2019-11-23 21:13:53,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056bc6a1d/ed548048af014f258254f0eb3c2fba6f/FLAG093524a70 [2019-11-23 21:13:53,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/056bc6a1d/ed548048af014f258254f0eb3c2fba6f [2019-11-23 21:13:53,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:13:53,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:13:53,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:13:53,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:13:53,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:13:53,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:53" (1/1) ... [2019-11-23 21:13:53,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f91590f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:53, skipping insertion in model container [2019-11-23 21:13:53,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:13:53" (1/1) ... [2019-11-23 21:13:53,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:13:53,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:13:54,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:13:54,321 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:13:54,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:13:54,488 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:13:54,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54 WrapperNode [2019-11-23 21:13:54,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:13:54,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:13:54,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:13:54,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:13:54,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:13:54,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:13:54,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:13:54,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:13:54,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (1/1) ... [2019-11-23 21:13:54,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:13:54,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:13:54,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:13:54,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:13:54,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (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 [2019-11-23 21:13:54,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:13:54,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:13:56,683 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:13:56,683 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:13:56,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:56 BoogieIcfgContainer [2019-11-23 21:13:56,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:13:56,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:13:56,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:13:56,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:13:56,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:13:53" (1/3) ... [2019-11-23 21:13:56,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76866ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:56, skipping insertion in model container [2019-11-23 21:13:56,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:13:54" (2/3) ... [2019-11-23 21:13:56,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76866ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:13:56, skipping insertion in model container [2019-11-23 21:13:56,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:13:56" (3/3) ... [2019-11-23 21:13:56,694 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label59.c [2019-11-23 21:13:56,705 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:13:56,713 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:13:56,726 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:13:56,755 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:13:56,755 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:13:56,755 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:13:56,756 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:13:56,756 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:13:56,756 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:13:56,756 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:13:56,756 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:13:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-23 21:13:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 21:13:56,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:56,789 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:56,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:56,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2102454322, now seen corresponding path program 1 times [2019-11-23 21:13:56,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:56,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543141452] [2019-11-23 21:13:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:13:57,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543141452] [2019-11-23 21:13:57,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:57,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:57,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317283903] [2019-11-23 21:13:57,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:57,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:57,096 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-23 21:13:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:59,107 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-23 21:13:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:59,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-23 21:13:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:59,128 INFO L225 Difference]: With dead ends: 850 [2019-11-23 21:13:59,129 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 21:13:59,134 INFO L630 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 [2019-11-23 21:13:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 21:13:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-23 21:13:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 21:13:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-11-23 21:13:59,229 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 40 [2019-11-23 21:13:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:59,229 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-11-23 21:13:59,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-11-23 21:13:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 21:13:59,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:59,234 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:13:59,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash 335241793, now seen corresponding path program 1 times [2019-11-23 21:13:59,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:59,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332689514] [2019-11-23 21:13:59,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:13:59,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332689514] [2019-11-23 21:13:59,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:59,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:59,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556564798] [2019-11-23 21:13:59,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:59,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:59,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:59,441 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-11-23 21:14:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:00,841 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2019-11-23 21:14:00,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:00,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-23 21:14:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:00,850 INFO L225 Difference]: With dead ends: 2142 [2019-11-23 21:14:00,850 INFO L226 Difference]: Without dead ends: 1606 [2019-11-23 21:14:00,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-23 21:14:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-23 21:14:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-23 21:14:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1982 transitions. [2019-11-23 21:14:00,903 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1982 transitions. Word has length 106 [2019-11-23 21:14:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:00,904 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1982 transitions. [2019-11-23 21:14:00,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1982 transitions. [2019-11-23 21:14:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 21:14:00,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:00,915 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:14:00,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1532171556, now seen corresponding path program 1 times [2019-11-23 21:14:00,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:00,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855254442] [2019-11-23 21:14:00,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:14:01,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855254442] [2019-11-23 21:14:01,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:01,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:01,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076380354] [2019-11-23 21:14:01,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:01,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:01,080 INFO L87 Difference]: Start difference. First operand 1428 states and 1982 transitions. Second operand 4 states. [2019-11-23 21:14:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:02,504 INFO L93 Difference]: Finished difference Result 4458 states and 6113 transitions. [2019-11-23 21:14:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:02,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-23 21:14:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:02,521 INFO L225 Difference]: With dead ends: 4458 [2019-11-23 21:14:02,522 INFO L226 Difference]: Without dead ends: 3032 [2019-11-23 21:14:02,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:14:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-11-23 21:14:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 3030. [2019-11-23 21:14:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-23 21:14:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3856 transitions. [2019-11-23 21:14:02,605 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3856 transitions. Word has length 108 [2019-11-23 21:14:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:02,606 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3856 transitions. [2019-11-23 21:14:02,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3856 transitions. [2019-11-23 21:14:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 21:14:02,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:02,608 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:14:02,608 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1707496834, now seen corresponding path program 1 times [2019-11-23 21:14:02,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:02,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452460326] [2019-11-23 21:14:02,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:14:02,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452460326] [2019-11-23 21:14:02,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:02,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:14:02,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065392105] [2019-11-23 21:14:02,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:14:02,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:14:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:14:02,696 INFO L87 Difference]: Start difference. First operand 3030 states and 3856 transitions. Second operand 3 states. [2019-11-23 21:14:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:03,445 INFO L93 Difference]: Finished difference Result 6948 states and 8861 transitions. [2019-11-23 21:14:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:14:03,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-23 21:14:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:03,463 INFO L225 Difference]: With dead ends: 6948 [2019-11-23 21:14:03,463 INFO L226 Difference]: Without dead ends: 3920 [2019-11-23 21:14:03,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:14:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-23 21:14:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3030. [2019-11-23 21:14:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-23 21:14:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3835 transitions. [2019-11-23 21:14:03,538 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3835 transitions. Word has length 120 [2019-11-23 21:14:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:03,539 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3835 transitions. [2019-11-23 21:14:03,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:14:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3835 transitions. [2019-11-23 21:14:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-23 21:14:03,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:03,543 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 21:14:03,543 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1520336677, now seen corresponding path program 1 times [2019-11-23 21:14:03,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:03,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286086040] [2019-11-23 21:14:03,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 21:14:03,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286086040] [2019-11-23 21:14:03,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837212983] [2019-11-23 21:14:03,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:03,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:14:03,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:14:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:14:04,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:14:04,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:14:04,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443487506] [2019-11-23 21:14:04,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:14:04,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:14:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:14:04,049 INFO L87 Difference]: Start difference. First operand 3030 states and 3835 transitions. Second operand 3 states. [2019-11-23 21:14:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:04,784 INFO L93 Difference]: Finished difference Result 5880 states and 7484 transitions. [2019-11-23 21:14:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:14:04,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-11-23 21:14:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:04,799 INFO L225 Difference]: With dead ends: 5880 [2019-11-23 21:14:04,799 INFO L226 Difference]: Without dead ends: 2852 [2019-11-23 21:14:04,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:14:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-23 21:14:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1962. [2019-11-23 21:14:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-23 21:14:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2498 transitions. [2019-11-23 21:14:04,856 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2498 transitions. Word has length 211 [2019-11-23 21:14:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:04,858 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2498 transitions. [2019-11-23 21:14:04,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:14:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2498 transitions. [2019-11-23 21:14:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-23 21:14:04,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:04,872 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:05,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:05,079 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash 616710149, now seen corresponding path program 1 times [2019-11-23 21:14:05,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:05,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128931438] [2019-11-23 21:14:05,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 249 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 21:14:05,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128931438] [2019-11-23 21:14:05,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040348752] [2019-11-23 21:14:05,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:05,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:14:05,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:14:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 21:14:06,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:14:06,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:14:06,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107646644] [2019-11-23 21:14:06,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:14:06,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:14:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:14:06,025 INFO L87 Difference]: Start difference. First operand 1962 states and 2498 transitions. Second operand 3 states. [2019-11-23 21:14:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:06,791 INFO L93 Difference]: Finished difference Result 3566 states and 4614 transitions. [2019-11-23 21:14:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:14:06,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-11-23 21:14:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:06,801 INFO L225 Difference]: With dead ends: 3566 [2019-11-23 21:14:06,801 INFO L226 Difference]: Without dead ends: 1962 [2019-11-23 21:14:06,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:14:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-23 21:14:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-11-23 21:14:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-23 21:14:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2099 transitions. [2019-11-23 21:14:06,838 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2099 transitions. Word has length 351 [2019-11-23 21:14:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:06,839 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2099 transitions. [2019-11-23 21:14:06,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:14:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2099 transitions. [2019-11-23 21:14:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-11-23 21:14:06,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:06,848 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:07,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:07,054 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash 107446009, now seen corresponding path program 1 times [2019-11-23 21:14:07,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:07,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422740004] [2019-11-23 21:14:07,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 410 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 21:14:07,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422740004] [2019-11-23 21:14:07,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447551505] [2019-11-23 21:14:07,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:08,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:14:08,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:14:08,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:14:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 391 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 21:14:08,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:14:08,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-23 21:14:08,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151773743] [2019-11-23 21:14:08,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:14:08,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:08,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:14:08,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:14:08,419 INFO L87 Difference]: Start difference. First operand 1784 states and 2099 transitions. Second operand 8 states. [2019-11-23 21:14:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:11,164 INFO L93 Difference]: Finished difference Result 3593 states and 4253 transitions. [2019-11-23 21:14:11,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:14:11,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 444 [2019-11-23 21:14:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:11,174 INFO L225 Difference]: With dead ends: 3593 [2019-11-23 21:14:11,174 INFO L226 Difference]: Without dead ends: 1989 [2019-11-23 21:14:11,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:14:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-11-23 21:14:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1784. [2019-11-23 21:14:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-23 21:14:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2087 transitions. [2019-11-23 21:14:11,210 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2087 transitions. Word has length 444 [2019-11-23 21:14:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:11,211 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2087 transitions. [2019-11-23 21:14:11,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:14:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2087 transitions. [2019-11-23 21:14:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-23 21:14:11,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:11,223 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:14:11,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:11,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -142907616, now seen corresponding path program 1 times [2019-11-23 21:14:11,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:11,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845076501] [2019-11-23 21:14:11,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 357 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-23 21:14:12,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845076501] [2019-11-23 21:14:12,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861465277] [2019-11-23 21:14:12,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:12,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:14:12,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:14:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-23 21:14:12,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:14:12,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:14:12,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791315459] [2019-11-23 21:14:12,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:14:12,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:14:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:14:12,652 INFO L87 Difference]: Start difference. First operand 1784 states and 2087 transitions. Second operand 4 states. [2019-11-23 21:14:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:13,559 INFO L93 Difference]: Finished difference Result 3595 states and 4201 transitions. [2019-11-23 21:14:13,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:14:13,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-23 21:14:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:13,569 INFO L225 Difference]: With dead ends: 3595 [2019-11-23 21:14:13,569 INFO L226 Difference]: Without dead ends: 1962 [2019-11-23 21:14:13,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:14:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-23 21:14:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-11-23 21:14:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-23 21:14:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1913 transitions. [2019-11-23 21:14:13,625 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1913 transitions. Word has length 526 [2019-11-23 21:14:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:13,626 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 1913 transitions. [2019-11-23 21:14:13,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:14:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1913 transitions. [2019-11-23 21:14:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-23 21:14:13,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:13,660 INFO L410 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 21:14:13,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:13,874 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1409455003, now seen corresponding path program 1 times [2019-11-23 21:14:13,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:13,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630109035] [2019-11-23 21:14:13,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 926 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-23 21:14:15,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630109035] [2019-11-23 21:14:15,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:14:15,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:14:15,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762704010] [2019-11-23 21:14:15,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:14:15,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:14:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:14:15,342 INFO L87 Difference]: Start difference. First operand 1784 states and 1913 transitions. Second operand 8 states. [2019-11-23 21:14:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:16,809 INFO L93 Difference]: Finished difference Result 3572 states and 3839 transitions. [2019-11-23 21:14:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:14:16,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 662 [2019-11-23 21:14:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:16,818 INFO L225 Difference]: With dead ends: 3572 [2019-11-23 21:14:16,818 INFO L226 Difference]: Without dead ends: 1968 [2019-11-23 21:14:16,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:14:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-23 21:14:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1962. [2019-11-23 21:14:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-23 21:14:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2093 transitions. [2019-11-23 21:14:16,851 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2093 transitions. Word has length 662 [2019-11-23 21:14:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:16,852 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2093 transitions. [2019-11-23 21:14:16,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:14:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2093 transitions. [2019-11-23 21:14:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2019-11-23 21:14:16,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:14:16,868 INFO L410 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-23 21:14:16,869 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:14:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:14:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2096537786, now seen corresponding path program 1 times [2019-11-23 21:14:16,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:14:16,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801120137] [2019-11-23 21:14:16,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:14:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 775 proven. 182 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-23 21:14:17,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801120137] [2019-11-23 21:14:17,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653410855] [2019-11-23 21:14:17,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:14:18,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:14:18,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:14:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:14:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:14:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 990 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-23 21:14:18,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:14:18,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-11-23 21:14:18,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014344788] [2019-11-23 21:14:18,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:14:18,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:14:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:14:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:14:18,642 INFO L87 Difference]: Start difference. First operand 1962 states and 2093 transitions. Second operand 5 states. [2019-11-23 21:14:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:14:20,471 INFO L93 Difference]: Finished difference Result 4810 states and 5190 transitions. [2019-11-23 21:14:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:14:20,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 688 [2019-11-23 21:14:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:14:20,474 INFO L225 Difference]: With dead ends: 4810 [2019-11-23 21:14:20,474 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:14:20,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 688 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:14:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:14:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:14:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:14:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:14:20,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 688 [2019-11-23 21:14:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:14:20,480 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:14:20,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:14:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:14:20,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:14:20,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:14:20,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:14:21,016 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-11-23 21:14:21,235 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:14:21,240 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,241 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-23 21:14:21,242 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-23 21:14:21,243 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:14:21,244 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-23 21:14:21,245 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,246 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-23 21:14:21,247 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:14:21,248 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,249 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-23 21:14:21,250 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-23 21:14:21,251 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:14:21,252 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 124) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,253 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-23 21:14:21,254 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:14:21,255 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:14:21,256 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:14:21,257 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:14:21,258 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-23 21:14:21,258 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-23 21:14:21,258 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-23 21:14:21,258 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,258 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,258 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 6))) (.cse0 (= ~a24~0 1)) (.cse2 (<= ~a12~0 11))) (or (and (exists ((v_~a12~0_435 Int)) (and (<= 0 (* 68 v_~a12~0_435)) (< 11 v_~a12~0_435) (<= (+ (* 5 (div (* v_~a12~0_435 68) 10)) 517842) ~a12~0) (<= 23 v_~a12~0_435))) .cse0) (<= ~a15~0 7) (and .cse1 .cse0 (<= 23 ~a12~0)) (and .cse0 (= ~a21~0 10) .cse2) (and .cse0 (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) (and (<= 9 ~a15~0) .cse0) (and .cse1 .cse0 .cse2 (< 0 (+ ~a12~0 43))))) [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-23 21:14:21,259 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-23 21:14:21,260 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-23 21:14:21,261 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 6))) (.cse0 (= ~a24~0 1)) (.cse2 (<= ~a12~0 11))) (or (and (exists ((v_~a12~0_435 Int)) (and (<= 0 (* 68 v_~a12~0_435)) (< 11 v_~a12~0_435) (<= (+ (* 5 (div (* v_~a12~0_435 68) 10)) 517842) ~a12~0) (<= 23 v_~a12~0_435))) .cse0) (<= ~a15~0 7) (and .cse1 .cse0 (<= 23 ~a12~0)) (and .cse0 (= ~a21~0 10) .cse2) (and .cse0 (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) (and (<= 9 ~a15~0) .cse0) (and .cse1 .cse0 .cse2 (< 0 (+ ~a12~0 43))))) [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-23 21:14:21,262 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,263 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-23 21:14:21,264 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:14:21,265 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-23 21:14:21,266 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,267 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,268 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:14:21,268 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-23 21:14:21,268 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:14:21,268 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:14:21,268 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:14:21,268 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-23 21:14:21,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:14:21 BoogieIcfgContainer [2019-11-23 21:14:21,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:14:21,296 INFO L168 Benchmark]: Toolchain (without parser) took 27626.48 ms. Allocated memory was 145.2 MB in the beginning and 894.4 MB in the end (delta: 749.2 MB). Free memory was 101.1 MB in the beginning and 466.5 MB in the end (delta: -365.4 MB). Peak memory consumption was 383.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,297 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.00 ms. Allocated memory was 145.2 MB in the beginning and 206.0 MB in the end (delta: 60.8 MB). Free memory was 100.7 MB in the beginning and 166.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 167.76 ms. Allocated memory is still 206.0 MB. Free memory was 166.8 MB in the beginning and 156.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,299 INFO L168 Benchmark]: Boogie Preprocessor took 120.55 ms. Allocated memory is still 206.0 MB. Free memory was 156.7 MB in the beginning and 150.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,302 INFO L168 Benchmark]: RCFGBuilder took 1906.17 ms. Allocated memory was 206.0 MB in the beginning and 239.1 MB in the end (delta: 33.0 MB). Free memory was 150.1 MB in the beginning and 138.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,303 INFO L168 Benchmark]: TraceAbstraction took 24607.58 ms. Allocated memory was 239.1 MB in the beginning and 894.4 MB in the end (delta: 655.4 MB). Free memory was 138.4 MB in the beginning and 466.5 MB in the end (delta: -328.1 MB). Peak memory consumption was 327.2 MB. Max. memory is 7.1 GB. [2019-11-23 21:14:21,311 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 820.00 ms. Allocated memory was 145.2 MB in the beginning and 206.0 MB in the end (delta: 60.8 MB). Free memory was 100.7 MB in the beginning and 166.8 MB in the end (delta: -66.1 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 167.76 ms. Allocated memory is still 206.0 MB. Free memory was 166.8 MB in the beginning and 156.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.55 ms. Allocated memory is still 206.0 MB. Free memory was 156.7 MB in the beginning and 150.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1906.17 ms. Allocated memory was 206.0 MB in the beginning and 239.1 MB in the end (delta: 33.0 MB). Free memory was 150.1 MB in the beginning and 138.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24607.58 ms. Allocated memory was 239.1 MB in the beginning and 894.4 MB in the end (delta: 655.4 MB). Free memory was 138.4 MB in the beginning and 466.5 MB in the end (delta: -328.1 MB). Peak memory consumption was 327.2 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_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: 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: 880]: Loop Invariant [2019-11-23 21:14:21,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1) || a15 <= 7) || ((!(a21 == 6) && a24 == 1) && 23 <= a12)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((a24 == 1 && a21 == 7) && a12 + 49 <= 0)) || (9 <= a15 && a24 == 1)) || (((!(a21 == 6) && a24 == 1) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant [2019-11-23 21:14:21,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-23 21:14:21,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1) || a15 <= 7) || ((!(a21 == 6) && a24 == 1) && 23 <= a12)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((a24 == 1 && a21 == 7) && a12 + 49 <= 0)) || (9 <= a15 && a24 == 1)) || (((!(a21 == 6) && a24 == 1) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 24.5s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 1430 SDtfs, 2816 SDslu, 130 SDs, 0 SdLazy, 10021 SolverSat, 1329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2268 GetRequests, 2221 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3030occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2527 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5660 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 562 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 5476 NumberOfCodeBlocks, 5476 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5461 ConstructedInterpolants, 38 QuantifiedInterpolants, 11690439 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2787 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 7212/7433 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...