/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/Problem01_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:50:55,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:50:55,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:50:55,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:50:55,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:50:55,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:50:55,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:50:55,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:50:55,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:50:55,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:50:55,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:50:55,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:50:55,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:50:55,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:50:55,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:50:55,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:50:55,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:50:55,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:50:55,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:50:55,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:50:55,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:50:55,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:50:55,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:50:55,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:50:55,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:50:55,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:50:55,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:50:55,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:50:55,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:50:55,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:50:55,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:50:55,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:50:55,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:50:55,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:50:55,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:50:55,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:50:55,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:50:55,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:50:55,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:50:55,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:50:55,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:50:55,081 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 20:50:55,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:50:55,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:50:55,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:50:55,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:50:55,109 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:50:55,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:50:55,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:50:55,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:50:55,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:50:55,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:50:55,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:50:55,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:50:55,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:50:55,112 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:50:55,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:50:55,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:50:55,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:50:55,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:50:55,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:50:55,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:50:55,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:50:55,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:50:55,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:50:55,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:50:55,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:50:55,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:50:55,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:50:55,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:50:55,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:50:55,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:50:55,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:50:55,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:50:55,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:50:55,396 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:50:55,397 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:50:55,398 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label02.c [2019-11-23 20:50:55,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f07107c3/1d39f84c38494a79982d31e1344d6f31/FLAG13235bd5c [2019-11-23 20:50:56,025 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:50:56,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label02.c [2019-11-23 20:50:56,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f07107c3/1d39f84c38494a79982d31e1344d6f31/FLAG13235bd5c [2019-11-23 20:50:56,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f07107c3/1d39f84c38494a79982d31e1344d6f31 [2019-11-23 20:50:56,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:50:56,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:50:56,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:50:56,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:50:56,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:50:56,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:56" (1/1) ... [2019-11-23 20:50:56,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446a24ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:56, skipping insertion in model container [2019-11-23 20:50:56,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:56" (1/1) ... [2019-11-23 20:50:56,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:50:56,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:50:56,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:50:56,815 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:50:57,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:50:57,056 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:50:57,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57 WrapperNode [2019-11-23 20:50:57,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:50:57,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:50:57,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:50:57,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:50:57,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:50:57,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:50:57,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:50:57,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:50:57,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (1/1) ... [2019-11-23 20:50:57,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:50:57,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:50:57,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:50:57,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:50:57,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (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 20:50:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:50:57,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:50:58,505 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:50:58,506 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:50:58,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:58 BoogieIcfgContainer [2019-11-23 20:50:58,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:50:58,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:50:58,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:50:58,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:50:58,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:50:56" (1/3) ... [2019-11-23 20:50:58,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192f4324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:58, skipping insertion in model container [2019-11-23 20:50:58,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:57" (2/3) ... [2019-11-23 20:50:58,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192f4324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:58, skipping insertion in model container [2019-11-23 20:50:58,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:58" (3/3) ... [2019-11-23 20:50:58,518 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2019-11-23 20:50:58,528 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:50:58,537 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:50:58,548 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:50:58,576 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:50:58,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:50:58,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:50:58,577 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:50:58,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:50:58,577 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:50:58,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:50:58,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:50:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:50:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 20:50:58,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:58,610 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, 1, 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 20:50:58,610 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:58,617 INFO L82 PathProgramCache]: Analyzing trace with hash -776841673, now seen corresponding path program 1 times [2019-11-23 20:50:58,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:58,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286115732] [2019-11-23 20:50:58,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:59,118 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 20:50:59,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286115732] [2019-11-23 20:50:59,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:59,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:59,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213422579] [2019-11-23 20:50:59,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:59,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:59,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:59,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:59,155 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:51:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:00,388 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:51:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:00,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-23 20:51:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:00,416 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:51:00,417 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:51:00,421 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 20:51:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:51:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-23 20:51:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:51:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-23 20:51:00,479 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 90 [2019-11-23 20:51:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:00,479 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-23 20:51:00,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-23 20:51:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 20:51:00,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:00,484 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:00,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 904352266, now seen corresponding path program 1 times [2019-11-23 20:51:00,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:00,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467914184] [2019-11-23 20:51:00,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:00,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467914184] [2019-11-23 20:51:00,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:00,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:00,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197925835] [2019-11-23 20:51:00,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:00,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:00,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:00,574 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-23 20:51:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:01,363 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-23 20:51:01,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:01,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-23 20:51:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:01,369 INFO L225 Difference]: With dead ends: 1054 [2019-11-23 20:51:01,370 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:51:01,371 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 20:51:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:51:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:51:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:51:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-23 20:51:01,413 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 96 [2019-11-23 20:51:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:01,413 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-23 20:51:01,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-23 20:51:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 20:51:01,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:01,420 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:01,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1983827210, now seen corresponding path program 1 times [2019-11-23 20:51:01,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:01,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706652192] [2019-11-23 20:51:01,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:01,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706652192] [2019-11-23 20:51:01,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:01,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:01,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460370217] [2019-11-23 20:51:01,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:01,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:01,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:01,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:01,539 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-23 20:51:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:02,056 INFO L93 Difference]: Finished difference Result 2233 states and 3029 transitions. [2019-11-23 20:51:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:02,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 20:51:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:02,065 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:51:02,065 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:51:02,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:51:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-23 20:51:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:51:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1878 transitions. [2019-11-23 20:51:02,103 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1878 transitions. Word has length 97 [2019-11-23 20:51:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:02,104 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1878 transitions. [2019-11-23 20:51:02,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1878 transitions. [2019-11-23 20:51:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-23 20:51:02,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:02,111 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:02,111 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:02,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1892128057, now seen corresponding path program 1 times [2019-11-23 20:51:02,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:02,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107069778] [2019-11-23 20:51:02,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:02,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107069778] [2019-11-23 20:51:02,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:02,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:02,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695371228] [2019-11-23 20:51:02,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:02,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:02,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:02,213 INFO L87 Difference]: Start difference. First operand 1445 states and 1878 transitions. Second operand 3 states. [2019-11-23 20:51:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:02,832 INFO L93 Difference]: Finished difference Result 3150 states and 4119 transitions. [2019-11-23 20:51:02,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:02,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-23 20:51:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:02,843 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:51:02,843 INFO L226 Difference]: Without dead ends: 1707 [2019-11-23 20:51:02,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-23 20:51:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-23 20:51:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:51:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1873 transitions. [2019-11-23 20:51:02,889 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1873 transitions. Word has length 116 [2019-11-23 20:51:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:02,890 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1873 transitions. [2019-11-23 20:51:02,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1873 transitions. [2019-11-23 20:51:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 20:51:02,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:02,893 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 20:51:02,894 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1006771335, now seen corresponding path program 1 times [2019-11-23 20:51:02,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:02,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077278746] [2019-11-23 20:51:02,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-23 20:51:02,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077278746] [2019-11-23 20:51:02,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:02,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:02,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339797398] [2019-11-23 20:51:02,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:02,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:02,965 INFO L87 Difference]: Start difference. First operand 1445 states and 1873 transitions. Second operand 3 states. [2019-11-23 20:51:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:03,519 INFO L93 Difference]: Finished difference Result 3805 states and 4890 transitions. [2019-11-23 20:51:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:03,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 20:51:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:03,530 INFO L225 Difference]: With dead ends: 3805 [2019-11-23 20:51:03,530 INFO L226 Difference]: Without dead ends: 2362 [2019-11-23 20:51:03,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-23 20:51:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1838. [2019-11-23 20:51:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2315 transitions. [2019-11-23 20:51:03,572 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2315 transitions. Word has length 133 [2019-11-23 20:51:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:03,572 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2315 transitions. [2019-11-23 20:51:03,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2315 transitions. [2019-11-23 20:51:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 20:51:03,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:03,576 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:03,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 546693328, now seen corresponding path program 1 times [2019-11-23 20:51:03,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:03,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884129215] [2019-11-23 20:51:03,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-23 20:51:03,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884129215] [2019-11-23 20:51:03,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:03,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:03,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707481959] [2019-11-23 20:51:03,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:03,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:03,644 INFO L87 Difference]: Start difference. First operand 1838 states and 2315 transitions. Second operand 3 states. [2019-11-23 20:51:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:04,099 INFO L93 Difference]: Finished difference Result 3936 states and 4944 transitions. [2019-11-23 20:51:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:04,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-23 20:51:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:04,109 INFO L225 Difference]: With dead ends: 3936 [2019-11-23 20:51:04,109 INFO L226 Difference]: Without dead ends: 2100 [2019-11-23 20:51:04,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-23 20:51:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-11-23 20:51:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-23 20:51:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2595 transitions. [2019-11-23 20:51:04,153 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2595 transitions. Word has length 155 [2019-11-23 20:51:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:04,154 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2595 transitions. [2019-11-23 20:51:04,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2595 transitions. [2019-11-23 20:51:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 20:51:04,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:04,158 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:04,159 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -967776360, now seen corresponding path program 1 times [2019-11-23 20:51:04,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:04,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272077451] [2019-11-23 20:51:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-23 20:51:04,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272077451] [2019-11-23 20:51:04,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:04,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 20:51:04,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130427868] [2019-11-23 20:51:04,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:51:04,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:51:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:51:04,386 INFO L87 Difference]: Start difference. First operand 2100 states and 2595 transitions. Second operand 8 states. [2019-11-23 20:51:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:05,520 INFO L93 Difference]: Finished difference Result 4371 states and 5367 transitions. [2019-11-23 20:51:05,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:51:05,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 20:51:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:05,531 INFO L225 Difference]: With dead ends: 4371 [2019-11-23 20:51:05,531 INFO L226 Difference]: Without dead ends: 2273 [2019-11-23 20:51:05,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:51:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-11-23 20:51:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2100. [2019-11-23 20:51:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-23 20:51:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2583 transitions. [2019-11-23 20:51:05,578 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2583 transitions. Word has length 159 [2019-11-23 20:51:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:05,578 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2583 transitions. [2019-11-23 20:51:05,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:51:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2583 transitions. [2019-11-23 20:51:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 20:51:05,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:05,584 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 20:51:05,584 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1011248568, now seen corresponding path program 1 times [2019-11-23 20:51:05,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:05,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085606900] [2019-11-23 20:51:05,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-23 20:51:05,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085606900] [2019-11-23 20:51:05,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:05,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:05,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057147625] [2019-11-23 20:51:05,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:05,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:05,708 INFO L87 Difference]: Start difference. First operand 2100 states and 2583 transitions. Second operand 4 states. [2019-11-23 20:51:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:06,504 INFO L93 Difference]: Finished difference Result 4331 states and 5314 transitions. [2019-11-23 20:51:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:06,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-23 20:51:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:06,513 INFO L225 Difference]: With dead ends: 4331 [2019-11-23 20:51:06,513 INFO L226 Difference]: Without dead ends: 2233 [2019-11-23 20:51:06,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 20:51:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2019-11-23 20:51:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2231. [2019-11-23 20:51:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-11-23 20:51:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2606 transitions. [2019-11-23 20:51:06,567 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2606 transitions. Word has length 192 [2019-11-23 20:51:06,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:06,567 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 2606 transitions. [2019-11-23 20:51:06,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:06,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2606 transitions. [2019-11-23 20:51:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 20:51:06,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:06,573 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:06,574 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -566866055, now seen corresponding path program 1 times [2019-11-23 20:51:06,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70101895] [2019-11-23 20:51:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-23 20:51:06,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70101895] [2019-11-23 20:51:06,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:06,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:06,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274868088] [2019-11-23 20:51:06,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:06,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:06,759 INFO L87 Difference]: Start difference. First operand 2231 states and 2606 transitions. Second operand 3 states. [2019-11-23 20:51:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:07,213 INFO L93 Difference]: Finished difference Result 2757 states and 3185 transitions. [2019-11-23 20:51:07,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:07,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-23 20:51:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:07,224 INFO L225 Difference]: With dead ends: 2757 [2019-11-23 20:51:07,224 INFO L226 Difference]: Without dead ends: 2755 [2019-11-23 20:51:07,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-23 20:51:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1969. [2019-11-23 20:51:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:51:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2324 transitions. [2019-11-23 20:51:07,261 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2324 transitions. Word has length 194 [2019-11-23 20:51:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:07,261 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2324 transitions. [2019-11-23 20:51:07,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2324 transitions. [2019-11-23 20:51:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 20:51:07,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:07,266 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:07,266 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 643345862, now seen corresponding path program 1 times [2019-11-23 20:51:07,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:07,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964587662] [2019-11-23 20:51:07,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-23 20:51:07,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964587662] [2019-11-23 20:51:07,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:07,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:07,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167943592] [2019-11-23 20:51:07,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:07,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:07,432 INFO L87 Difference]: Start difference. First operand 1969 states and 2324 transitions. Second operand 4 states. [2019-11-23 20:51:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:08,071 INFO L93 Difference]: Finished difference Result 4460 states and 5224 transitions. [2019-11-23 20:51:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:08,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-23 20:51:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:08,080 INFO L225 Difference]: With dead ends: 4460 [2019-11-23 20:51:08,080 INFO L226 Difference]: Without dead ends: 2493 [2019-11-23 20:51:08,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:51:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-23 20:51:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-23 20:51:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:51:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2312 transitions. [2019-11-23 20:51:08,116 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2312 transitions. Word has length 198 [2019-11-23 20:51:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2312 transitions. [2019-11-23 20:51:08,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2312 transitions. [2019-11-23 20:51:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-23 20:51:08,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:08,122 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2019-11-23 20:51:08,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash -333400197, now seen corresponding path program 1 times [2019-11-23 20:51:08,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:08,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827511816] [2019-11-23 20:51:08,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-23 20:51:08,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827511816] [2019-11-23 20:51:08,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:08,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:51:08,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882632883] [2019-11-23 20:51:08,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:51:08,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:51:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:51:08,285 INFO L87 Difference]: Start difference. First operand 1969 states and 2312 transitions. Second operand 6 states. [2019-11-23 20:51:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:09,143 INFO L93 Difference]: Finished difference Result 4105 states and 4797 transitions. [2019-11-23 20:51:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:09,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2019-11-23 20:51:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:09,151 INFO L225 Difference]: With dead ends: 4105 [2019-11-23 20:51:09,152 INFO L226 Difference]: Without dead ends: 2138 [2019-11-23 20:51:09,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:51:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-23 20:51:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-23 20:51:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-23 20:51:09,185 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 219 [2019-11-23 20:51:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:09,185 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-23 20:51:09,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:51:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-23 20:51:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 20:51:09,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:09,190 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-23 20:51:09,191 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 471134404, now seen corresponding path program 1 times [2019-11-23 20:51:09,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:09,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758624265] [2019-11-23 20:51:09,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-23 20:51:09,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758624265] [2019-11-23 20:51:09,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248314631] [2019-11-23 20:51:09,356 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 20:51:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:09,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:51:09,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-23 20:51:09,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:51:09,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-23 20:51:09,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920112559] [2019-11-23 20:51:09,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:09,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:09,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:09,588 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-23 20:51:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:10,050 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-23 20:51:10,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:10,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-23 20:51:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:10,051 INFO L225 Difference]: With dead ends: 3672 [2019-11-23 20:51:10,052 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:51:10,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 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 20:51:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:51:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:51:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:51:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:51:10,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-11-23 20:51:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:10,056 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:51:10,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:51:10,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:51:10,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:10,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:51:10,404 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2019-11-23 20:51:10,544 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 92 [2019-11-23 20:51:10,837 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2019-11-23 20:51:11,151 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2019-11-23 20:51:11,154 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:51:11,154 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:51:11,155 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:51:11,156 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:51:11,156 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:51:11,156 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:51:11,156 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,157 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,158 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,158 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,158 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:51:11,159 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:51:11,161 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:51:11,162 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:51:11,162 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:51:11,162 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:51:11,163 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:51:11,164 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:51:11,165 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 0)) (.cse5 (= ~a16~0 6)) (.cse0 (= ~a16~0 4)) (.cse6 (not (= 1 ~a7~0))) (.cse4 (<= ~a21~0 0)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse3 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse4 .cse5) (and .cse6 .cse2 .cse5 .cse3) (and .cse7 (= ~a20~0 1) .cse2) (and .cse6 .cse7 .cse2) (and .cse0 .cse6 .cse2) (and .cse4 .cse7) (and .cse2 .cse3 (= ~a16~0 5)))) [2019-11-23 20:51:11,165 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,165 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,165 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,165 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,165 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:51:11,166 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,167 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:51:11,168 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:51:11,169 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:51:11,170 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,171 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 0)) (.cse5 (= ~a16~0 6)) (.cse0 (= ~a16~0 4)) (.cse6 (not (= 1 ~a7~0))) (.cse4 (<= ~a21~0 0)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse3 (not (= 13 ~a8~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse4 .cse5) (and .cse6 .cse2 .cse5 .cse3) (and .cse7 (= ~a20~0 1) .cse2) (and .cse6 .cse7 .cse2) (and .cse0 .cse6 .cse2) (and .cse4 .cse7) (and .cse2 .cse3 (= ~a16~0 5)))) [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:51:11,172 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,173 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:51:11,174 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,175 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:51:11,176 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,177 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:51:11,178 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:51:11,179 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,180 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:51:11,181 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:51:11,182 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:51:11,182 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:51:11,182 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:51:11,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:51:11 BoogieIcfgContainer [2019-11-23 20:51:11,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:51:11,223 INFO L168 Benchmark]: Toolchain (without parser) took 14936.17 ms. Allocated memory was 138.4 MB in the beginning and 502.3 MB in the end (delta: 363.9 MB). Free memory was 99.4 MB in the beginning and 195.6 MB in the end (delta: -96.3 MB). Peak memory consumption was 267.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,224 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.87 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 99.2 MB in the beginning and 171.6 MB in the end (delta: -72.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.59 ms. Allocated memory is still 205.0 MB. Free memory was 171.6 MB in the beginning and 165.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,226 INFO L168 Benchmark]: Boogie Preprocessor took 80.62 ms. Allocated memory is still 205.0 MB. Free memory was 165.8 MB in the beginning and 160.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,230 INFO L168 Benchmark]: RCFGBuilder took 1270.92 ms. Allocated memory was 205.0 MB in the beginning and 236.5 MB in the end (delta: 31.5 MB). Free memory was 160.8 MB in the beginning and 172.7 MB in the end (delta: -11.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,231 INFO L168 Benchmark]: TraceAbstraction took 12709.46 ms. Allocated memory was 236.5 MB in the beginning and 502.3 MB in the end (delta: 265.8 MB). Free memory was 172.7 MB in the beginning and 195.6 MB in the end (delta: -23.0 MB). Peak memory consumption was 242.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:11,242 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.87 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 99.2 MB in the beginning and 171.6 MB in the end (delta: -72.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 97.59 ms. Allocated memory is still 205.0 MB. Free memory was 171.6 MB in the beginning and 165.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.62 ms. Allocated memory is still 205.0 MB. Free memory was 165.8 MB in the beginning and 160.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1270.92 ms. Allocated memory was 205.0 MB in the beginning and 236.5 MB in the end (delta: 31.5 MB). Free memory was 160.8 MB in the beginning and 172.7 MB in the end (delta: -11.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12709.46 ms. Allocated memory was 236.5 MB in the beginning and 502.3 MB in the end (delta: 265.8 MB). Free memory was 172.7 MB in the beginning and 195.6 MB in the end (delta: -23.0 MB). Peak memory consumption was 242.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a17 <= 0) && a21 == 1) && !(13 == a8)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1)) || (a21 <= 0 && a17 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a17 <= 0) && a21 == 1) && !(13 == a8)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a16 == 6)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && !(13 == a8))) || ((a17 == 1 && a20 == 1) && a21 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1)) || (a21 <= 0 && a17 == 1)) || ((a21 == 1 && !(13 == a8)) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.6s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 930 SDtfs, 2193 SDslu, 136 SDs, 0 SdLazy, 6433 SolverSat, 1043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2702 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 195 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16249 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3449 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 915680 SizeOfPredicates, 1 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1826/1830 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...