/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/Problem10_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:04:20,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:04:20,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:04:21,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:04:21,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:04:21,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:04:21,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:04:21,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:04:21,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:04:21,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:04:21,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:04:21,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:04:21,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:04:21,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:04:21,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:04:21,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:04:21,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:04:21,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:04:21,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:04:21,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:04:21,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:04:21,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:04:21,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:04:21,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:04:21,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:04:21,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:04:21,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:04:21,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:04:21,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:04:21,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:04:21,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:04:21,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:04:21,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:04:21,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:04:21,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:04:21,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:04:21,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:04:21,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:04:21,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:04:21,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:04:21,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:04:21,043 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:04:21,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:04:21,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:04:21,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:04:21,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:04:21,060 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:04:21,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:04:21,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:04:21,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:04:21,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:04:21,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:04:21,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:04:21,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:04:21,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:04:21,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:04:21,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:04:21,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:04:21,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:04:21,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:04:21,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:04:21,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:04:21,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:04:21,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:04:21,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:04:21,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:04:21,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:04:21,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:04:21,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:04:21,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:04:21,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:04:21,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:04:21,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:04:21,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:04:21,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:04:21,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:04:21,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:04:21,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59.c [2019-11-23 21:04:21,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2bfa4ec/95cd0f3b1b1143b18e3f4ee7a3bf82d1/FLAG3cf4592ce [2019-11-23 21:04:22,007 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:04:22,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label59.c [2019-11-23 21:04:22,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2bfa4ec/95cd0f3b1b1143b18e3f4ee7a3bf82d1/FLAG3cf4592ce [2019-11-23 21:04:22,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2bfa4ec/95cd0f3b1b1143b18e3f4ee7a3bf82d1 [2019-11-23 21:04:22,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:04:22,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:04:22,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:04:22,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:04:22,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:04:22,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:04:22" (1/1) ... [2019-11-23 21:04:22,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5d560f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:22, skipping insertion in model container [2019-11-23 21:04:22,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:04:22" (1/1) ... [2019-11-23 21:04:22,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:04:22,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:04:22,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:04:22,950 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:04:23,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:04:23,114 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:04:23,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23 WrapperNode [2019-11-23 21:04:23,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:04:23,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:04:23,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:04:23,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:04:23,123 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:04:23" (1/1) ... [2019-11-23 21:04:23,141 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:04:23" (1/1) ... [2019-11-23 21:04:23,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:04:23,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:04:23,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:04:23,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:04:23,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (1/1) ... [2019-11-23 21:04:23,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:04:23,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:04:23,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:04:23,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:04:23,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (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:04:23,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:04:23,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:04:24,742 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:04:24,742 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:04:24,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:24 BoogieIcfgContainer [2019-11-23 21:04:24,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:04:24,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:04:24,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:04:24,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:04:24,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:04:22" (1/3) ... [2019-11-23 21:04:24,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666ce299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:24, skipping insertion in model container [2019-11-23 21:04:24,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:04:23" (2/3) ... [2019-11-23 21:04:24,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666ce299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:04:24, skipping insertion in model container [2019-11-23 21:04:24,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:04:24" (3/3) ... [2019-11-23 21:04:24,753 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label59.c [2019-11-23 21:04:24,763 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:04:24,772 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:04:24,784 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:04:24,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:04:24,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:04:24,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:04:24,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:04:24,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:04:24,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:04:24,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:04:24,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:04:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-23 21:04:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 21:04:24,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:24,864 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, 1, 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:04:24,865 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash 962891993, now seen corresponding path program 1 times [2019-11-23 21:04:24,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:24,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740883279] [2019-11-23 21:04:24,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:25,254 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:04:25,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740883279] [2019-11-23 21:04:25,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:25,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:25,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018124313] [2019-11-23 21:04:25,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:25,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:25,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:25,281 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-23 21:04:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:26,703 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2019-11-23 21:04:26,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:26,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-23 21:04:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:26,724 INFO L225 Difference]: With dead ends: 709 [2019-11-23 21:04:26,724 INFO L226 Difference]: Without dead ends: 421 [2019-11-23 21:04:26,729 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:04:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-23 21:04:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-11-23 21:04:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-23 21:04:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-11-23 21:04:26,793 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 65 [2019-11-23 21:04:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:26,794 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-11-23 21:04:26,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-11-23 21:04:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 21:04:26,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:26,800 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, 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] [2019-11-23 21:04:26,801 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2138327860, now seen corresponding path program 1 times [2019-11-23 21:04:26,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:26,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361147136] [2019-11-23 21:04:26,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:27,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361147136] [2019-11-23 21:04:27,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:27,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:27,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980806211] [2019-11-23 21:04:27,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:27,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:27,073 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-11-23 21:04:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:28,382 INFO L93 Difference]: Finished difference Result 1118 states and 1720 transitions. [2019-11-23 21:04:28,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:28,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-23 21:04:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:28,389 INFO L225 Difference]: With dead ends: 1118 [2019-11-23 21:04:28,390 INFO L226 Difference]: Without dead ends: 838 [2019-11-23 21:04:28,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:04:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-23 21:04:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-23 21:04:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-23 21:04:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1138 transitions. [2019-11-23 21:04:28,476 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1138 transitions. Word has length 131 [2019-11-23 21:04:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:28,477 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1138 transitions. [2019-11-23 21:04:28,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1138 transitions. [2019-11-23 21:04:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-23 21:04:28,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:28,491 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, 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] [2019-11-23 21:04:28,492 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1097584517, now seen corresponding path program 1 times [2019-11-23 21:04:28,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:28,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621233054] [2019-11-23 21:04:28,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:28,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621233054] [2019-11-23 21:04:28,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:28,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:28,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095000114] [2019-11-23 21:04:28,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:28,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:28,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:28,716 INFO L87 Difference]: Start difference. First operand 838 states and 1138 transitions. Second operand 4 states. [2019-11-23 21:04:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:29,721 INFO L93 Difference]: Finished difference Result 1952 states and 2682 transitions. [2019-11-23 21:04:29,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:29,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-23 21:04:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:29,728 INFO L225 Difference]: With dead ends: 1952 [2019-11-23 21:04:29,728 INFO L226 Difference]: Without dead ends: 1116 [2019-11-23 21:04:29,730 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:04:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-23 21:04:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-11-23 21:04:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-11-23 21:04:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1386 transitions. [2019-11-23 21:04:29,758 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1386 transitions. Word has length 142 [2019-11-23 21:04:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:29,758 INFO L462 AbstractCegarLoop]: Abstraction has 1116 states and 1386 transitions. [2019-11-23 21:04:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1386 transitions. [2019-11-23 21:04:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 21:04:29,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:29,763 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:29,763 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1600410530, now seen corresponding path program 1 times [2019-11-23 21:04:29,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:29,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85127126] [2019-11-23 21:04:29,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:29,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85127126] [2019-11-23 21:04:29,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:29,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:04:29,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417009845] [2019-11-23 21:04:29,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:04:29,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:29,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:04:29,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:04:29,951 INFO L87 Difference]: Start difference. First operand 1116 states and 1386 transitions. Second operand 4 states. [2019-11-23 21:04:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:30,928 INFO L93 Difference]: Finished difference Result 3759 states and 4676 transitions. [2019-11-23 21:04:30,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:04:30,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-23 21:04:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:30,942 INFO L225 Difference]: With dead ends: 3759 [2019-11-23 21:04:30,943 INFO L226 Difference]: Without dead ends: 2645 [2019-11-23 21:04:30,946 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:04:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-23 21:04:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-11-23 21:04:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-23 21:04:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2043 transitions. [2019-11-23 21:04:30,998 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2043 transitions. Word has length 192 [2019-11-23 21:04:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:31,000 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2043 transitions. [2019-11-23 21:04:31,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:04:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2043 transitions. [2019-11-23 21:04:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-23 21:04:31,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:31,004 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, 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, 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:04:31,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:31,004 INFO L82 PathProgramCache]: Analyzing trace with hash -354141657, now seen corresponding path program 1 times [2019-11-23 21:04:31,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:31,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771938227] [2019-11-23 21:04:31,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 67 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:31,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771938227] [2019-11-23 21:04:31,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515571089] [2019-11-23 21:04:31,274 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:04:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:31,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:04:31,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:31,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:04:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:31,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:04:31,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:04:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:31,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-23 21:04:31,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87226951] [2019-11-23 21:04:31,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:04:31,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:04:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:04:31,884 INFO L87 Difference]: Start difference. First operand 1672 states and 2043 transitions. Second operand 8 states. [2019-11-23 21:04:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:35,242 INFO L93 Difference]: Finished difference Result 4871 states and 5954 transitions. [2019-11-23 21:04:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:04:35,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-11-23 21:04:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:35,257 INFO L225 Difference]: With dead ends: 4871 [2019-11-23 21:04:35,257 INFO L226 Difference]: Without dead ends: 3201 [2019-11-23 21:04:35,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:04:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-11-23 21:04:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 1950. [2019-11-23 21:04:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-11-23 21:04:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2231 transitions. [2019-11-23 21:04:35,317 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2231 transitions. Word has length 213 [2019-11-23 21:04:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:35,317 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 2231 transitions. [2019-11-23 21:04:35,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:04:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2231 transitions. [2019-11-23 21:04:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-23 21:04:35,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:35,323 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:35,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:35,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1412343006, now seen corresponding path program 1 times [2019-11-23 21:04:35,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:35,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937551719] [2019-11-23 21:04:35,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:35,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937551719] [2019-11-23 21:04:35,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:35,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:04:35,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070194171] [2019-11-23 21:04:35,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:35,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:35,766 INFO L87 Difference]: Start difference. First operand 1950 states and 2231 transitions. Second operand 5 states. [2019-11-23 21:04:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:37,232 INFO L93 Difference]: Finished difference Result 5427 states and 6240 transitions. [2019-11-23 21:04:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:37,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-11-23 21:04:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:37,245 INFO L225 Difference]: With dead ends: 5427 [2019-11-23 21:04:37,245 INFO L226 Difference]: Without dead ends: 1811 [2019-11-23 21:04:37,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-23 21:04:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1672. [2019-11-23 21:04:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-23 21:04:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1838 transitions. [2019-11-23 21:04:37,285 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1838 transitions. Word has length 217 [2019-11-23 21:04:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:37,289 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1838 transitions. [2019-11-23 21:04:37,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1838 transitions. [2019-11-23 21:04:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-23 21:04:37,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:37,294 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:04:37,295 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash -416019249, now seen corresponding path program 1 times [2019-11-23 21:04:37,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:37,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009632558] [2019-11-23 21:04:37,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 21:04:37,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009632558] [2019-11-23 21:04:37,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:37,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:04:37,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445985244] [2019-11-23 21:04:37,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:37,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:37,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:37,502 INFO L87 Difference]: Start difference. First operand 1672 states and 1838 transitions. Second operand 5 states. [2019-11-23 21:04:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:38,876 INFO L93 Difference]: Finished difference Result 4454 states and 4918 transitions. [2019-11-23 21:04:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:38,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-11-23 21:04:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:38,889 INFO L225 Difference]: With dead ends: 4454 [2019-11-23 21:04:38,890 INFO L226 Difference]: Without dead ends: 2784 [2019-11-23 21:04:38,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-11-23 21:04:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2228. [2019-11-23 21:04:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-23 21:04:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2439 transitions. [2019-11-23 21:04:38,942 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2439 transitions. Word has length 230 [2019-11-23 21:04:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:38,943 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2439 transitions. [2019-11-23 21:04:38,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2439 transitions. [2019-11-23 21:04:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-11-23 21:04:38,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:38,950 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, 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, 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] [2019-11-23 21:04:38,950 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:38,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:38,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1031491534, now seen corresponding path program 1 times [2019-11-23 21:04:38,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:38,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307542875] [2019-11-23 21:04:38,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 253 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 21:04:39,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307542875] [2019-11-23 21:04:39,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664439812] [2019-11-23 21:04:39,927 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:04:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:40,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 21:04:40,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 317 proven. 34 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-23 21:04:40,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 12 [2019-11-23 21:04:40,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883073143] [2019-11-23 21:04:40,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:04:40,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:04:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:04:40,354 INFO L87 Difference]: Start difference. First operand 2228 states and 2439 transitions. Second operand 13 states. [2019-11-23 21:04:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:42,888 INFO L93 Difference]: Finished difference Result 4791 states and 5270 transitions. [2019-11-23 21:04:42,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:04:42,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 341 [2019-11-23 21:04:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:42,901 INFO L225 Difference]: With dead ends: 4791 [2019-11-23 21:04:42,901 INFO L226 Difference]: Without dead ends: 2704 [2019-11-23 21:04:42,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 339 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:04:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-11-23 21:04:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2506. [2019-11-23 21:04:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-23 21:04:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2711 transitions. [2019-11-23 21:04:42,956 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2711 transitions. Word has length 341 [2019-11-23 21:04:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:42,957 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 2711 transitions. [2019-11-23 21:04:42,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:04:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2711 transitions. [2019-11-23 21:04:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-11-23 21:04:42,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:42,969 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, 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, 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] [2019-11-23 21:04:43,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:43,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash 352328165, now seen corresponding path program 1 times [2019-11-23 21:04:43,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:43,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864402785] [2019-11-23 21:04:43,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 89 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:04:43,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864402785] [2019-11-23 21:04:43,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575796780] [2019-11-23 21:04:43,674 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:04:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:43,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 21:04:43,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:43,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:43,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 330 proven. 62 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 21:04:44,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:44,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-11-23 21:04:44,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358904131] [2019-11-23 21:04:44,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:04:44,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:04:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:04:44,319 INFO L87 Difference]: Start difference. First operand 2506 states and 2711 transitions. Second operand 11 states. [2019-11-23 21:04:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:47,586 INFO L93 Difference]: Finished difference Result 6539 states and 7075 transitions. [2019-11-23 21:04:47,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:04:47,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 363 [2019-11-23 21:04:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:47,604 INFO L225 Difference]: With dead ends: 6539 [2019-11-23 21:04:47,604 INFO L226 Difference]: Without dead ends: 4174 [2019-11-23 21:04:47,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:04:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2019-11-23 21:04:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 2784. [2019-11-23 21:04:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-11-23 21:04:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 2978 transitions. [2019-11-23 21:04:47,671 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 2978 transitions. Word has length 363 [2019-11-23 21:04:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:47,672 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 2978 transitions. [2019-11-23 21:04:47,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:04:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 2978 transitions. [2019-11-23 21:04:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-23 21:04:47,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:47,681 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, 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, 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] [2019-11-23 21:04:47,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:47,885 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -127843405, now seen corresponding path program 1 times [2019-11-23 21:04:47,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:47,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322155286] [2019-11-23 21:04:47,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 42 proven. 351 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-23 21:04:49,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322155286] [2019-11-23 21:04:49,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143605007] [2019-11-23 21:04:49,052 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:04:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:49,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 21:04:49,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:04:49,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:04:49,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:49,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:04:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 12 proven. 381 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-23 21:04:50,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:04:50,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-11-23 21:04:50,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268100646] [2019-11-23 21:04:50,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:04:50,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:04:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:04:50,143 INFO L87 Difference]: Start difference. First operand 2784 states and 2978 transitions. Second operand 12 states. [2019-11-23 21:04:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:54,839 INFO L93 Difference]: Finished difference Result 6833 states and 7328 transitions. [2019-11-23 21:04:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:04:54,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 382 [2019-11-23 21:04:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:54,858 INFO L225 Difference]: With dead ends: 6833 [2019-11-23 21:04:54,858 INFO L226 Difference]: Without dead ends: 4190 [2019-11-23 21:04:54,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 377 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:04:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-23 21:04:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2708. [2019-11-23 21:04:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-11-23 21:04:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 2893 transitions. [2019-11-23 21:04:54,915 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 2893 transitions. Word has length 382 [2019-11-23 21:04:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:54,916 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 2893 transitions. [2019-11-23 21:04:54,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:04:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 2893 transitions. [2019-11-23 21:04:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-11-23 21:04:54,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:04:54,933 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, 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, 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, 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] [2019-11-23 21:04:55,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:04:55,137 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:04:55,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:04:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash 318816942, now seen corresponding path program 1 times [2019-11-23 21:04:55,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:04:55,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047415675] [2019-11-23 21:04:55,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:04:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:04:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-23 21:04:55,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047415675] [2019-11-23 21:04:55,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:04:55,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:04:55,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007944876] [2019-11-23 21:04:55,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:04:55,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:04:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:04:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:55,883 INFO L87 Difference]: Start difference. First operand 2708 states and 2893 transitions. Second operand 5 states. [2019-11-23 21:04:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:04:57,111 INFO L93 Difference]: Finished difference Result 6107 states and 6523 transitions. [2019-11-23 21:04:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:04:57,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 581 [2019-11-23 21:04:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:04:57,112 INFO L225 Difference]: With dead ends: 6107 [2019-11-23 21:04:57,112 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:04:57,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:04:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:04:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:04:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:04:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:04:57,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 581 [2019-11-23 21:04:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:04:57,119 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:04:57,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:04:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:04:57,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:04:57,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:04:57,605 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 300 [2019-11-23 21:04:58,150 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 294 [2019-11-23 21:04:59,724 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 290 DAG size of output: 56 [2019-11-23 21:05:01,235 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 284 DAG size of output: 51 [2019-11-23 21:05:01,239 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-23 21:05:01,239 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-23 21:05:01,240 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-23 21:05:01,241 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:05:01,241 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:05:01,241 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:05:01,241 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:05:01,241 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,242 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:05:01,243 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-23 21:05:01,244 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:05:01,245 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:05:01,246 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:05:01,246 INFO L440 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse5 (= ~a10~0 0))) (let ((.cse1 (<= ~a10~0 2)) (.cse0 (<= 0 (+ ~a1~0 600000))) (.cse4 (= 14 ~a4~0)) (.cse2 (= ~a19~0 9)) (.cse6 (= ~a12~0 0)) (.cse8 (not (= ~a10~0 1))) (.cse7 (not .cse5)) (.cse3 (not (= ~a19~0 10))) (.cse9 (<= ~a19~0 8))) (or (and .cse0 .cse1 (not .cse2)) (and .cse3 .cse4 .cse5 .cse6 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0)) (< 0 (+ ~a1~0 13))) (and .cse0 .cse4 .cse1 .cse6 .cse7) (and .cse4 .cse2 (= ~a10~0 2) .cse6) (and .cse0 .cse3 .cse4 .cse2 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse8 .cse7) (and .cse3 .cse5 .cse9)))) [2019-11-23 21:05:01,246 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-23 21:05:01,246 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,247 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-23 21:05:01,248 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L447 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,249 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-23 21:05:01,250 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-23 21:05:01,251 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-23 21:05:01,252 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:05:01,253 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-23 21:05:01,253 INFO L440 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse5 (= ~a10~0 0))) (let ((.cse1 (<= ~a10~0 2)) (.cse0 (<= 0 (+ ~a1~0 600000))) (.cse2 (= ~a19~0 9)) (.cse8 (not (= ~a10~0 1))) (.cse7 (not .cse5)) (.cse4 (= 14 ~a4~0)) (.cse6 (= ~a12~0 0)) (.cse3 (not (= ~a19~0 10))) (.cse9 (<= ~a19~0 8))) (or (and .cse0 .cse1 (not .cse2)) (and .cse3 .cse4 .cse5 .cse6 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0)) (< 0 (+ ~a1~0 13))) (and .cse0 .cse4 .cse1 .cse6 .cse7) (and .cse4 .cse2 (= ~a10~0 2) .cse6) (and .cse0 .cse3 .cse4 .cse2 .cse6 .cse8 .cse7) (and .cse3 .cse9 .cse8 .cse7) (and (<= 23 ~a1~0) (<= ~a1~0 23) .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse9)))) [2019-11-23 21:05:01,253 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-23 21:05:01,253 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,253 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,253 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,253 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:05:01,254 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-23 21:05:01,255 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-23 21:05:01,256 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-23 21:05:01,257 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,258 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:05:01,259 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,260 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:05:01,261 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,262 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-23 21:05:01,263 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-23 21:05:01,264 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-23 21:05:01,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:05:01 BoogieIcfgContainer [2019-11-23 21:05:01,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:05:01,289 INFO L168 Benchmark]: Toolchain (without parser) took 38930.10 ms. Allocated memory was 137.9 MB in the beginning and 834.1 MB in the end (delta: 696.3 MB). Free memory was 100.8 MB in the beginning and 438.4 MB in the end (delta: -337.6 MB). Peak memory consumption was 674.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,290 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.13 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 100.6 MB in the beginning and 168.7 MB in the end (delta: -68.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.92 ms. Allocated memory is still 204.5 MB. Free memory was 168.7 MB in the beginning and 160.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,292 INFO L168 Benchmark]: Boogie Preprocessor took 88.65 ms. Allocated memory is still 204.5 MB. Free memory was 160.1 MB in the beginning and 155.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,293 INFO L168 Benchmark]: RCFGBuilder took 1444.70 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 155.1 MB in the beginning and 168.8 MB in the end (delta: -13.7 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,294 INFO L168 Benchmark]: TraceAbstraction took 36541.80 ms. Allocated memory was 236.5 MB in the beginning and 834.1 MB in the end (delta: 597.7 MB). Free memory was 167.4 MB in the beginning and 438.4 MB in the end (delta: -271.1 MB). Peak memory consumption was 642.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:05:01,300 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.13 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 100.6 MB in the beginning and 168.7 MB in the end (delta: -68.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.92 ms. Allocated memory is still 204.5 MB. Free memory was 168.7 MB in the beginning and 160.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.65 ms. Allocated memory is still 204.5 MB. Free memory was 160.1 MB in the beginning and 155.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1444.70 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 155.1 MB in the beginning and 168.8 MB in the end (delta: -13.7 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36541.80 ms. Allocated memory was 236.5 MB in the beginning and 834.1 MB in the end (delta: 597.7 MB). Free memory was 167.4 MB in the beginning and 438.4 MB in the end (delta: -271.1 MB). Peak memory consumption was 642.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: ((((((((0 <= a1 + 600000 && a10 <= 2) && !(a19 == 9)) || (((((!(a19 == 10) && 14 == a4) && a10 == 0) && a12 == 0) && (!(5 == input) || 218 < a1)) && 0 < a1 + 13)) || ((((0 <= a1 + 600000 && 14 == a4) && a10 <= 2) && a12 == 0) && !(a10 == 0))) || (((14 == a4 && a19 == 9) && a10 == 2) && a12 == 0)) || ((((((0 <= a1 + 600000 && !(a19 == 10)) && 14 == a4) && a19 == 9) && a12 == 0) && !(a10 == 1)) && !(a10 == 0))) || (((!(a19 == 10) && a19 <= 8) && !(a10 == 1)) && !(a10 == 0))) || ((((23 <= a1 && a1 <= 23) && 14 == a4) && a10 == 0) && a12 == 0)) || ((!(a19 == 10) && a10 == 0) && a19 <= 8) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((0 <= a1 + 600000 && a10 <= 2) && !(a19 == 9)) || (((((!(a19 == 10) && 14 == a4) && a10 == 0) && a12 == 0) && (!(5 == input) || 218 < a1)) && 0 < a1 + 13)) || ((((0 <= a1 + 600000 && 14 == a4) && a10 <= 2) && a12 == 0) && !(a10 == 0))) || (((14 == a4 && a19 == 9) && a10 == 2) && a12 == 0)) || ((((((0 <= a1 + 600000 && !(a19 == 10)) && 14 == a4) && a19 == 9) && a12 == 0) && !(a10 == 1)) && !(a10 == 0))) || (((!(a19 == 10) && a19 <= 8) && !(a10 == 1)) && !(a10 == 0))) || ((!(a19 == 10) && a10 == 0) && a19 <= 8) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 36.4s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 666 SDtfs, 7177 SDslu, 293 SDs, 0 SdLazy, 15602 SolverSat, 2270 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1392 GetRequests, 1302 SyntacticMatches, 16 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2784occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 6128 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 82 NumberOfFragments, 271 HoareAnnotationTreeSize, 3 FomulaSimplifications, 12084 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 82654 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 4156 NumberOfCodeBlocks, 4156 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4141 ConstructedInterpolants, 313 QuantifiedInterpolants, 11281016 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1717 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 3296/4841 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...