/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/Problem03_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:15,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:15,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:15,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:15,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:15,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:15,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:15,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:15,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:15,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:15,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:15,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:15,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:15,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:15,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:15,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:15,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:15,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:15,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:15,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:15,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:15,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:15,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:15,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:15,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:15,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:15,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:15,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:15,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:15,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:15,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:15,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:15,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:15,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:15,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:15,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:15,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:15,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:15,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:15,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:15,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:15,161 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:55:15,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:15,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:15,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:15,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:15,203 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:15,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:15,203 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:15,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:15,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:15,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:15,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:15,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:15,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:15,204 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:15,204 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:15,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:15,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:15,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:15,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:15,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:15,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:15,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:15,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:15,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:15,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:15,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:15,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:15,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:15,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:15,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:15,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:15,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:15,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:15,547 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:15,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label10.c [2019-11-23 20:55:15,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6f177cc/700a7f55e6004197a56135e764995891/FLAG024fb815d [2019-11-23 20:55:16,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:16,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label10.c [2019-11-23 20:55:16,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6f177cc/700a7f55e6004197a56135e764995891/FLAG024fb815d [2019-11-23 20:55:16,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6f177cc/700a7f55e6004197a56135e764995891 [2019-11-23 20:55:16,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:16,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:16,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:16,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:16,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:16,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:16" (1/1) ... [2019-11-23 20:55:16,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182f03c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:16, skipping insertion in model container [2019-11-23 20:55:16,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:16" (1/1) ... [2019-11-23 20:55:16,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:16,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:17,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:17,341 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:17,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:17,735 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:17,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17 WrapperNode [2019-11-23 20:55:17,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:17,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:17,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:17,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:17,750 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:55:17" (1/1) ... [2019-11-23 20:55:17,797 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:55:17" (1/1) ... [2019-11-23 20:55:17,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:17,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:17,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:17,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:17,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:17,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (1/1) ... [2019-11-23 20:55:18,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:18,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:18,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:18,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:18,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (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:55:18,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:18,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:20,080 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:20,081 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:20,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:20 BoogieIcfgContainer [2019-11-23 20:55:20,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:20,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:20,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:20,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:20,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:16" (1/3) ... [2019-11-23 20:55:20,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d2441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:20, skipping insertion in model container [2019-11-23 20:55:20,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:17" (2/3) ... [2019-11-23 20:55:20,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d2441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:20, skipping insertion in model container [2019-11-23 20:55:20,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:20" (3/3) ... [2019-11-23 20:55:20,091 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label10.c [2019-11-23 20:55:20,101 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:20,112 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:20,124 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:20,172 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:20,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:20,172 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:20,173 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:20,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:20,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:20,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:20,174 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-23 20:55:20,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:20,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:20,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash 991324555, now seen corresponding path program 1 times [2019-11-23 20:55:20,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:20,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518198121] [2019-11-23 20:55:20,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:21,085 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:55:21,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518198121] [2019-11-23 20:55:21,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:21,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:21,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616101357] [2019-11-23 20:55:21,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:21,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:21,122 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:55:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:23,243 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-11-23 20:55:23,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:23,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-23 20:55:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:23,270 INFO L225 Difference]: With dead ends: 1075 [2019-11-23 20:55:23,270 INFO L226 Difference]: Without dead ends: 677 [2019-11-23 20:55:23,276 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:55:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-11-23 20:55:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-11-23 20:55:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-23 20:55:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-11-23 20:55:23,366 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 181 [2019-11-23 20:55:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:23,368 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-11-23 20:55:23,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-11-23 20:55:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-23 20:55:23,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:23,372 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:23,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1803921076, now seen corresponding path program 1 times [2019-11-23 20:55:23,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:23,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895379848] [2019-11-23 20:55:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:23,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895379848] [2019-11-23 20:55:23,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:23,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:23,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680941954] [2019-11-23 20:55:23,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:23,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:23,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:23,483 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-11-23 20:55:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:24,640 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-11-23 20:55:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:24,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-23 20:55:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:24,647 INFO L225 Difference]: With dead ends: 1323 [2019-11-23 20:55:24,647 INFO L226 Difference]: Without dead ends: 874 [2019-11-23 20:55:24,650 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:55:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-23 20:55:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-11-23 20:55:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:55:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-23 20:55:24,683 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 189 [2019-11-23 20:55:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:24,683 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-23 20:55:24,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-23 20:55:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 20:55:24,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:24,687 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:24,688 INFO L82 PathProgramCache]: Analyzing trace with hash -716075313, now seen corresponding path program 1 times [2019-11-23 20:55:24,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:24,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486494634] [2019-11-23 20:55:24,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:24,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486494634] [2019-11-23 20:55:24,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:24,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:24,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965301762] [2019-11-23 20:55:24,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:24,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:24,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:24,766 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-23 20:55:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:25,333 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-23 20:55:25,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:25,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-23 20:55:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:25,338 INFO L225 Difference]: With dead ends: 1695 [2019-11-23 20:55:25,338 INFO L226 Difference]: Without dead ends: 838 [2019-11-23 20:55:25,340 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:55:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-23 20:55:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-23 20:55:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-23 20:55:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-23 20:55:25,396 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 194 [2019-11-23 20:55:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:25,397 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-23 20:55:25,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-23 20:55:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-23 20:55:25,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:25,401 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:25,401 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1122639935, now seen corresponding path program 1 times [2019-11-23 20:55:25,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:25,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143025509] [2019-11-23 20:55:25,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:55:25,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143025509] [2019-11-23 20:55:25,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:25,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:25,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750139174] [2019-11-23 20:55:25,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:25,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:25,501 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-23 20:55:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:27,035 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-23 20:55:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:27,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-23 20:55:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:27,049 INFO L225 Difference]: With dead ends: 3313 [2019-11-23 20:55:27,049 INFO L226 Difference]: Without dead ends: 2477 [2019-11-23 20:55:27,051 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:55:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-23 20:55:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-23 20:55:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-23 20:55:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-23 20:55:27,097 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 195 [2019-11-23 20:55:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-23 20:55:27,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-23 20:55:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-23 20:55:27,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:27,103 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,103 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash -331316582, now seen corresponding path program 1 times [2019-11-23 20:55:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:27,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498130770] [2019-11-23 20:55:27,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 20:55:27,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498130770] [2019-11-23 20:55:27,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:27,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:27,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232965319] [2019-11-23 20:55:27,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:27,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:27,191 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-23 20:55:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:28,163 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-23 20:55:28,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:28,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-23 20:55:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:28,175 INFO L225 Difference]: With dead ends: 4133 [2019-11-23 20:55:28,176 INFO L226 Difference]: Without dead ends: 2480 [2019-11-23 20:55:28,179 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:55:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-23 20:55:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-23 20:55:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-23 20:55:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-23 20:55:28,267 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 198 [2019-11-23 20:55:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:28,268 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-23 20:55:28,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-23 20:55:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-23 20:55:28,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:28,274 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:28,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1798503547, now seen corresponding path program 1 times [2019-11-23 20:55:28,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:28,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922147777] [2019-11-23 20:55:28,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:55:28,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922147777] [2019-11-23 20:55:28,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:28,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:28,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468313386] [2019-11-23 20:55:28,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:28,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:28,364 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-23 20:55:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:28,784 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-23 20:55:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:28,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-23 20:55:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:28,807 INFO L225 Difference]: With dead ends: 7424 [2019-11-23 20:55:28,808 INFO L226 Difference]: Without dead ends: 4947 [2019-11-23 20:55:28,813 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:55:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-23 20:55:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-23 20:55:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-23 20:55:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-23 20:55:28,947 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 201 [2019-11-23 20:55:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:28,947 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-23 20:55:28,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-23 20:55:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-23 20:55:28,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:28,964 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:28,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1112433142, now seen corresponding path program 1 times [2019-11-23 20:55:28,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:28,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082405290] [2019-11-23 20:55:28,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:29,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082405290] [2019-11-23 20:55:29,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:29,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:29,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556018841] [2019-11-23 20:55:29,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:29,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:29,119 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-23 20:55:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:30,237 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-23 20:55:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:30,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-11-23 20:55:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:30,273 INFO L225 Difference]: With dead ends: 14560 [2019-11-23 20:55:30,274 INFO L226 Difference]: Without dead ends: 9617 [2019-11-23 20:55:30,282 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:55:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-23 20:55:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-23 20:55:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-23 20:55:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12497 transitions. [2019-11-23 20:55:30,439 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12497 transitions. Word has length 203 [2019-11-23 20:55:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:30,440 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12497 transitions. [2019-11-23 20:55:30,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12497 transitions. [2019-11-23 20:55:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 20:55:30,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:30,452 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,453 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash 579998981, now seen corresponding path program 2 times [2019-11-23 20:55:30,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:30,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216638162] [2019-11-23 20:55:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:30,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216638162] [2019-11-23 20:55:30,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:30,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:30,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825995986] [2019-11-23 20:55:30,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:30,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:30,529 INFO L87 Difference]: Start difference. First operand 9615 states and 12497 transitions. Second operand 3 states. [2019-11-23 20:55:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,672 INFO L93 Difference]: Finished difference Result 26540 states and 34570 transitions. [2019-11-23 20:55:31,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-23 20:55:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,720 INFO L225 Difference]: With dead ends: 26540 [2019-11-23 20:55:31,721 INFO L226 Difference]: Without dead ends: 16927 [2019-11-23 20:55:31,733 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:55:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-23 20:55:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-23 20:55:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-23 20:55:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20100 transitions. [2019-11-23 20:55:31,969 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20100 transitions. Word has length 205 [2019-11-23 20:55:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,969 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20100 transitions. [2019-11-23 20:55:31,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20100 transitions. [2019-11-23 20:55:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-23 20:55:31,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,989 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,989 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,989 INFO L82 PathProgramCache]: Analyzing trace with hash -942107321, now seen corresponding path program 1 times [2019-11-23 20:55:31,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21539063] [2019-11-23 20:55:31,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:32,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21539063] [2019-11-23 20:55:32,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:32,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:32,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670531960] [2019-11-23 20:55:32,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:32,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:32,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:32,140 INFO L87 Difference]: Start difference. First operand 16923 states and 20100 transitions. Second operand 5 states. [2019-11-23 20:55:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:34,316 INFO L93 Difference]: Finished difference Result 35285 states and 41994 transitions. [2019-11-23 20:55:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:34,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-11-23 20:55:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:34,373 INFO L225 Difference]: With dead ends: 35285 [2019-11-23 20:55:34,373 INFO L226 Difference]: Without dead ends: 18364 [2019-11-23 20:55:34,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18364 states. [2019-11-23 20:55:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18364 to 17532. [2019-11-23 20:55:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-23 20:55:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20720 transitions. [2019-11-23 20:55:34,666 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20720 transitions. Word has length 219 [2019-11-23 20:55:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:34,666 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20720 transitions. [2019-11-23 20:55:34,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20720 transitions. [2019-11-23 20:55:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-23 20:55:34,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:34,687 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,688 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash -765401032, now seen corresponding path program 1 times [2019-11-23 20:55:34,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:34,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861124038] [2019-11-23 20:55:34,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 20:55:34,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861124038] [2019-11-23 20:55:34,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:34,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:34,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801311530] [2019-11-23 20:55:34,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:34,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:34,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:34,817 INFO L87 Difference]: Start difference. First operand 17532 states and 20720 transitions. Second operand 4 states. [2019-11-23 20:55:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:36,115 INFO L93 Difference]: Finished difference Result 35064 states and 41442 transitions. [2019-11-23 20:55:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:36,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-23 20:55:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:36,144 INFO L225 Difference]: With dead ends: 35064 [2019-11-23 20:55:36,145 INFO L226 Difference]: Without dead ends: 17534 [2019-11-23 20:55:36,161 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:55:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17534 states. [2019-11-23 20:55:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17534 to 17532. [2019-11-23 20:55:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17532 states. [2019-11-23 20:55:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17532 states to 17532 states and 20181 transitions. [2019-11-23 20:55:36,422 INFO L78 Accepts]: Start accepts. Automaton has 17532 states and 20181 transitions. Word has length 223 [2019-11-23 20:55:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:36,428 INFO L462 AbstractCegarLoop]: Abstraction has 17532 states and 20181 transitions. [2019-11-23 20:55:36,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 17532 states and 20181 transitions. [2019-11-23 20:55:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-23 20:55:36,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:36,456 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,457 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1099774521, now seen corresponding path program 1 times [2019-11-23 20:55:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:36,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806302333] [2019-11-23 20:55:36,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:36,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806302333] [2019-11-23 20:55:36,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494945026] [2019-11-23 20:55:36,701 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:55:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:36,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:55:37,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:37,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:37,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:55:37,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800976386] [2019-11-23 20:55:37,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:37,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:37,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:37,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:55:37,138 INFO L87 Difference]: Start difference. First operand 17532 states and 20181 transitions. Second operand 3 states. [2019-11-23 20:55:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:38,221 INFO L93 Difference]: Finished difference Result 34660 states and 39922 transitions. [2019-11-23 20:55:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:38,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-23 20:55:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:38,250 INFO L225 Difference]: With dead ends: 34660 [2019-11-23 20:55:38,250 INFO L226 Difference]: Without dead ends: 17130 [2019-11-23 20:55:38,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:55:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2019-11-23 20:55:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16314. [2019-11-23 20:55:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16314 states. [2019-11-23 20:55:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 18381 transitions. [2019-11-23 20:55:38,476 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 18381 transitions. Word has length 229 [2019-11-23 20:55:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:38,476 INFO L462 AbstractCegarLoop]: Abstraction has 16314 states and 18381 transitions. [2019-11-23 20:55:38,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 18381 transitions. [2019-11-23 20:55:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-23 20:55:38,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:38,498 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:38,702 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1221063350, now seen corresponding path program 1 times [2019-11-23 20:55:38,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:38,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373979802] [2019-11-23 20:55:38,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:55:39,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373979802] [2019-11-23 20:55:39,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878844365] [2019-11-23 20:55:39,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:39,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:55:39,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:55:39,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:39,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-23 20:55:39,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438502722] [2019-11-23 20:55:39,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:39,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:39,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:39,722 INFO L87 Difference]: Start difference. First operand 16314 states and 18381 transitions. Second operand 3 states. [2019-11-23 20:55:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:40,226 INFO L93 Difference]: Finished difference Result 47676 states and 53681 transitions. [2019-11-23 20:55:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:40,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-23 20:55:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:40,273 INFO L225 Difference]: With dead ends: 47676 [2019-11-23 20:55:40,273 INFO L226 Difference]: Without dead ends: 31364 [2019-11-23 20:55:40,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31364 states. [2019-11-23 20:55:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31364 to 31362. [2019-11-23 20:55:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31362 states. [2019-11-23 20:55:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31362 states to 31362 states and 35287 transitions. [2019-11-23 20:55:40,678 INFO L78 Accepts]: Start accepts. Automaton has 31362 states and 35287 transitions. Word has length 258 [2019-11-23 20:55:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:40,679 INFO L462 AbstractCegarLoop]: Abstraction has 31362 states and 35287 transitions. [2019-11-23 20:55:40,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 31362 states and 35287 transitions. [2019-11-23 20:55:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-23 20:55:40,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:40,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:40,938 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1710674889, now seen corresponding path program 1 times [2019-11-23 20:55:40,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:40,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928808731] [2019-11-23 20:55:40,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:41,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928808731] [2019-11-23 20:55:41,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:41,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:41,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063990201] [2019-11-23 20:55:41,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:41,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:41,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:41,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:41,385 INFO L87 Difference]: Start difference. First operand 31362 states and 35287 transitions. Second operand 4 states. [2019-11-23 20:55:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:42,726 INFO L93 Difference]: Finished difference Result 88385 states and 99396 transitions. [2019-11-23 20:55:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:42,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-23 20:55:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:42,776 INFO L225 Difference]: With dead ends: 88385 [2019-11-23 20:55:42,776 INFO L226 Difference]: Without dead ends: 57025 [2019-11-23 20:55:42,799 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:55:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57025 states. [2019-11-23 20:55:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57025 to 57023. [2019-11-23 20:55:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57023 states. [2019-11-23 20:55:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57023 states to 57023 states and 64060 transitions. [2019-11-23 20:55:43,463 INFO L78 Accepts]: Start accepts. Automaton has 57023 states and 64060 transitions. Word has length 281 [2019-11-23 20:55:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:43,463 INFO L462 AbstractCegarLoop]: Abstraction has 57023 states and 64060 transitions. [2019-11-23 20:55:43,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 57023 states and 64060 transitions. [2019-11-23 20:55:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-23 20:55:43,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:43,488 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:43,489 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -625354885, now seen corresponding path program 1 times [2019-11-23 20:55:43,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:43,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045450586] [2019-11-23 20:55:43,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:43,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045450586] [2019-11-23 20:55:43,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:43,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:43,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136835100] [2019-11-23 20:55:43,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:43,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:43,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:43,899 INFO L87 Difference]: Start difference. First operand 57023 states and 64060 transitions. Second operand 3 states. [2019-11-23 20:55:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:46,091 INFO L93 Difference]: Finished difference Result 150649 states and 168878 transitions. [2019-11-23 20:55:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:46,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-23 20:55:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:46,174 INFO L225 Difference]: With dead ends: 150649 [2019-11-23 20:55:46,174 INFO L226 Difference]: Without dead ends: 93628 [2019-11-23 20:55:46,199 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:55:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93628 states. [2019-11-23 20:55:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93628 to 93626. [2019-11-23 20:55:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93626 states. [2019-11-23 20:55:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93626 states to 93626 states and 104802 transitions. [2019-11-23 20:55:47,019 INFO L78 Accepts]: Start accepts. Automaton has 93626 states and 104802 transitions. Word has length 332 [2019-11-23 20:55:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:47,019 INFO L462 AbstractCegarLoop]: Abstraction has 93626 states and 104802 transitions. [2019-11-23 20:55:47,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 93626 states and 104802 transitions. [2019-11-23 20:55:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-23 20:55:47,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:47,324 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:47,324 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2069549447, now seen corresponding path program 1 times [2019-11-23 20:55:47,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:47,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975513819] [2019-11-23 20:55:47,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-23 20:55:47,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975513819] [2019-11-23 20:55:47,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:47,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:47,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599892895] [2019-11-23 20:55:47,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:47,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:47,449 INFO L87 Difference]: Start difference. First operand 93626 states and 104802 transitions. Second operand 4 states. [2019-11-23 20:55:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:49,342 INFO L93 Difference]: Finished difference Result 206331 states and 232381 transitions. [2019-11-23 20:55:49,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:49,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-23 20:55:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:49,436 INFO L225 Difference]: With dead ends: 206331 [2019-11-23 20:55:49,436 INFO L226 Difference]: Without dead ends: 112707 [2019-11-23 20:55:49,480 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:55:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112707 states. [2019-11-23 20:55:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112707 to 112691. [2019-11-23 20:55:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112691 states. [2019-11-23 20:55:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112691 states to 112691 states and 123941 transitions. [2019-11-23 20:55:52,357 INFO L78 Accepts]: Start accepts. Automaton has 112691 states and 123941 transitions. Word has length 344 [2019-11-23 20:55:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:52,357 INFO L462 AbstractCegarLoop]: Abstraction has 112691 states and 123941 transitions. [2019-11-23 20:55:52,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 112691 states and 123941 transitions. [2019-11-23 20:55:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-23 20:55:52,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:52,395 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:52,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:52,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1140434467, now seen corresponding path program 1 times [2019-11-23 20:55:52,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:52,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708721835] [2019-11-23 20:55:52,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-23 20:55:53,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708721835] [2019-11-23 20:55:53,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:53,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:53,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154197946] [2019-11-23 20:55:53,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:53,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:53,075 INFO L87 Difference]: Start difference. First operand 112691 states and 123941 transitions. Second operand 3 states. [2019-11-23 20:55:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:54,550 INFO L93 Difference]: Finished difference Result 244323 states and 269032 transitions. [2019-11-23 20:55:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:54,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2019-11-23 20:55:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:54,551 INFO L225 Difference]: With dead ends: 244323 [2019-11-23 20:55:54,551 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:55:54,617 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:55:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:55:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:55:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:55:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:55:54,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 408 [2019-11-23 20:55:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:54,618 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:55:54,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:55:54,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:55:54,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:55:57,008 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-11-23 20:55:58,284 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 672 DAG size of output: 172 [2019-11-23 20:56:00,336 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-23 20:56:02,623 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 172 DAG size of output: 86 [2019-11-23 20:56:02,628 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:56:02,628 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:56:02,628 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,628 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,628 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:56:02,629 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,630 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,631 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,632 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,633 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:56:02,634 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:56:02,635 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:56:02,636 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:56:02,637 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,638 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,639 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,640 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse13 (= 1 ~a6~0)) (.cse7 (= ~a27~0 1))) (let ((.cse14 (= 1 ~a4~0)) (.cse6 (<= ~a27~0 0)) (.cse10 (= 1 ~a3~0)) (.cse15 (not .cse7)) (.cse4 (= 1 ~a0~0)) (.cse12 (<= ~a3~0 0)) (.cse9 (<= ~a11~0 0)) (.cse5 (= ~a16~0 1)) (.cse0 (= 1 ~a5~0)) (.cse11 (not (= ~a12~0 1))) (.cse8 (not (= 1 ~a7~0))) (.cse2 (not .cse13)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse4) (and .cse7 .cse10 .cse0 .cse11 .cse9 .cse3) (and .cse12 .cse7 .cse0 .cse2 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse11 .cse9 .cse2 .cse3) (and .cse0 .cse13 .cse11 .cse9 .cse4) (and .cse0 .cse13 .cse8 .cse9 .cse4 .cse5 .cse14 .cse6) (and .cse0 .cse13 .cse11 .cse1 .cse3) (and .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse10 .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse14) (and .cse0 .cse15 .cse8 .cse11 .cse1 .cse2 .cse5) (and .cse0 .cse8 .cse11 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse13 .cse11 .cse8 .cse9) (and .cse7 .cse0 .cse9 .cse4 .cse5) (and .cse0 .cse11 .cse8 .cse9 .cse3) (and .cse12 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse13 .cse11 .cse9 .cse14) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse4) (and .cse12 .cse0 .cse1 .cse3 .cse5 .cse14) (and .cse7 .cse0 .cse13 .cse9 .cse14) (and .cse7 .cse0 .cse13 .cse8 .cse1 .cse5 .cse14) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse3 .cse5) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse15 .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse14) (and .cse10 .cse0 .cse8 .cse9 .cse4 .cse14) (and .cse10 .cse0 .cse13 .cse8 .cse1 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse14) (and .cse0 .cse8 .cse9 .cse3 .cse14) (and .cse7 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse14) (and .cse0 .cse7 .cse11 .cse2 .cse1 .cse4) (and .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse3) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse2 .cse1 .cse3 .cse5) (and .cse10 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse9 .cse2) (and .cse0 .cse8 .cse9 .cse2 .cse3) (and .cse12 .cse7 .cse0 .cse13 .cse11 .cse1) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse15 .cse11 .cse1 .cse2 .cse5 .cse4) (and .cse12 .cse7 .cse0 .cse9 .cse3 .cse5) (and .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse3)))) [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:56:02,641 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1578) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,642 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,643 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:56:02,644 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:56:02,644 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse13 (= 1 ~a6~0)) (.cse7 (= ~a27~0 1))) (let ((.cse14 (= 1 ~a4~0)) (.cse6 (<= ~a27~0 0)) (.cse10 (= 1 ~a3~0)) (.cse15 (not .cse7)) (.cse4 (= 1 ~a0~0)) (.cse12 (<= ~a3~0 0)) (.cse9 (<= ~a11~0 0)) (.cse5 (= ~a16~0 1)) (.cse0 (= 1 ~a5~0)) (.cse11 (not (= ~a12~0 1))) (.cse8 (not (= 1 ~a7~0))) (.cse2 (not .cse13)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse4) (and .cse7 .cse10 .cse0 .cse11 .cse9 .cse3) (and .cse12 .cse7 .cse0 .cse2 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse11 .cse9 .cse2 .cse3) (and .cse0 .cse13 .cse11 .cse9 .cse4) (and .cse0 .cse13 .cse8 .cse9 .cse4 .cse5 .cse14 .cse6) (and .cse0 .cse13 .cse11 .cse1 .cse3) (and .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse10 .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse5) (and .cse0 .cse9 .cse2 .cse3 .cse14) (and .cse0 .cse15 .cse8 .cse11 .cse1 .cse2 .cse5) (and .cse0 .cse8 .cse11 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse13 .cse11 .cse8 .cse9) (and .cse7 .cse0 .cse9 .cse4 .cse5) (and .cse0 .cse11 .cse8 .cse9 .cse3) (and .cse12 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse13 .cse11 .cse9 .cse14) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse4) (and .cse12 .cse0 .cse1 .cse3 .cse5 .cse14) (and .cse7 .cse0 .cse13 .cse9 .cse14) (and .cse7 .cse0 .cse13 .cse8 .cse1 .cse5 .cse14) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse3 .cse5) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse15 .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse14) (and .cse10 .cse0 .cse8 .cse9 .cse4 .cse14) (and .cse10 .cse0 .cse13 .cse8 .cse1 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse14) (and .cse0 .cse8 .cse9 .cse3 .cse14) (and .cse7 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse7 .cse11 .cse2 .cse1 .cse14) (and .cse0 .cse7 .cse11 .cse2 .cse1 .cse4) (and .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse12 .cse7 .cse0 .cse13 .cse1 .cse3) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse2 .cse1 .cse3 .cse5) (and .cse10 .cse0 .cse9 .cse2 .cse4) (and .cse12 .cse0 .cse9 .cse2) (and .cse0 .cse8 .cse9 .cse2 .cse3) (and .cse12 .cse7 .cse0 .cse13 .cse11 .cse1) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse15 .cse11 .cse1 .cse2 .cse5 .cse4) (and .cse12 .cse7 .cse0 .cse9 .cse3 .cse5) (and .cse0 .cse7 .cse11 .cse8 .cse2 .cse1 .cse3)))) [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,645 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,646 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:56:02,647 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,648 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,649 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:56:02,650 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:56:02,651 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,652 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,653 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:56:02,654 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,655 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,656 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:56:02,657 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:56:02,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:56:02 BoogieIcfgContainer [2019-11-23 20:56:02,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:56:02,735 INFO L168 Benchmark]: Toolchain (without parser) took 46232.71 ms. Allocated memory was 137.4 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 95.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,736 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1233.34 ms. Allocated memory was 137.4 MB in the beginning and 203.4 MB in the end (delta: 66.1 MB). Free memory was 95.2 MB in the beginning and 122.8 MB in the end (delta: -27.6 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.42 ms. Allocated memory is still 203.4 MB. Free memory was 122.8 MB in the beginning and 107.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,738 INFO L168 Benchmark]: Boogie Preprocessor took 128.00 ms. Allocated memory is still 203.4 MB. Free memory was 107.9 MB in the beginning and 96.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,739 INFO L168 Benchmark]: RCFGBuilder took 2069.20 ms. Allocated memory was 203.4 MB in the beginning and 263.7 MB in the end (delta: 60.3 MB). Free memory was 96.8 MB in the beginning and 94.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,739 INFO L168 Benchmark]: TraceAbstraction took 42647.53 ms. Allocated memory was 263.7 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 94.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-11-23 20:56:02,743 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1233.34 ms. Allocated memory was 137.4 MB in the beginning and 203.4 MB in the end (delta: 66.1 MB). Free memory was 95.2 MB in the beginning and 122.8 MB in the end (delta: -27.6 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 147.42 ms. Allocated memory is still 203.4 MB. Free memory was 122.8 MB in the beginning and 107.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.00 ms. Allocated memory is still 203.4 MB. Free memory was 107.9 MB in the beginning and 96.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2069.20 ms. Allocated memory was 203.4 MB in the beginning and 263.7 MB in the end (delta: 60.3 MB). Free memory was 96.8 MB in the beginning and 94.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42647.53 ms. Allocated memory was 263.7 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 94.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1578]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0) || ((((a27 == 1 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a0)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || (((((((1 == a5 && 1 == a6) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((1 == a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((((1 == a5 && !(a27 == 1)) && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((1 == a5 && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a11 <= 0)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0) && a16 == 1)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a3 <= 0 && 1 == a5) && !(a27 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && 1 == a4)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || ((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a4)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 == a5 && !(1 == a7)) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0) || ((((a27 == 1 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0)) || (((((a27 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a0)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || (((((((1 == a5 && 1 == a6) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4) && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((1 == a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || ((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((((1 == a5 && !(a27 == 1)) && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1)) || (((((1 == a5 && !(1 == a7)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a11 <= 0)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0) && a16 == 1)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && !(1 == a7)) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4)) || ((((((a27 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && 1 == a4)) || (((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || (((((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || ((((((a3 <= 0 && 1 == a5) && !(a27 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4)) || (((((1 == a3 && 1 == a5) && !(1 == a7)) && a11 <= 0) && 1 == a0) && 1 == a4)) || ((((((1 == a3 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1) && a27 <= 0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && 1 == a4)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || ((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a4)) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1) && a27 <= 0)) || (((((((a3 <= 0 && a27 == 1) && 1 == a5) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || ((((1 == a5 && !(1 == a7)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 == a5 && !(1 == a7)) && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((((1 == a5 && !(a27 == 1)) && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a16 == 1) && 1 == a0)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a7)) && !(1 == a6)) && a11 == 1) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 42.4s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, HoareTripleCheckerStatistics: 2855 SDtfs, 5400 SDslu, 1187 SDs, 0 SdLazy, 9799 SolverSat, 2103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 502 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112691occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 2744 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1202 NumberOfFragments, 1967 HoareAnnotationTreeSize, 3 FomulaSimplifications, 44514 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7816 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 4347 NumberOfCodeBlocks, 4347 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1998649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 1360/1367 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...