/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_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:19,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:19,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:20,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:20,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:20,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:20,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:20,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:20,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:20,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:20,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:20,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:20,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:20,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:20,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:20,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:20,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:20,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:20,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:20,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:20,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:20,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:20,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:20,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:20,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:20,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:20,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:20,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:20,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:20,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:20,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:20,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:20,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:20,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:20,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:20,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:20,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:20,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:20,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:20,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:20,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:20,053 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:20,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:20,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:20,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:20,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:20,068 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:20,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:20,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:20,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:20,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:20,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:20,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:20,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:20,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:20,070 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:20,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:20,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:20,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:20,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:20,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:20,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:20,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:20,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:20,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:20,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:20,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:20,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:20,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:20,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:20,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:20,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:20,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:20,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:20,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:20,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:20,384 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:20,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label24.c [2019-11-23 20:55:20,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247a00035/34194369536d42c6ac5caeb95d14f1db/FLAGe5b07a593 [2019-11-23 20:55:21,098 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:21,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label24.c [2019-11-23 20:55:21,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247a00035/34194369536d42c6ac5caeb95d14f1db/FLAGe5b07a593 [2019-11-23 20:55:21,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247a00035/34194369536d42c6ac5caeb95d14f1db [2019-11-23 20:55:21,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:21,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:21,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:21,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:21,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:21,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:21" (1/1) ... [2019-11-23 20:55:21,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e4ca28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:21, skipping insertion in model container [2019-11-23 20:55:21,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:21" (1/1) ... [2019-11-23 20:55:21,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:21,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:22,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:22,165 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:22,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:22,459 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:22,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:22 WrapperNode [2019-11-23 20:55:22,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:22,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:22,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:22,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:22,471 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:22" (1/1) ... [2019-11-23 20:55:22,519 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:22" (1/1) ... [2019-11-23 20:55:22,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:22,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:22,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:22,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:22,636 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:22" (1/1) ... [2019-11-23 20:55:22,636 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:22" (1/1) ... [2019-11-23 20:55:22,644 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:22" (1/1) ... [2019-11-23 20:55:22,645 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:22" (1/1) ... [2019-11-23 20:55:22,720 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:22" (1/1) ... [2019-11-23 20:55:22,751 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:22" (1/1) ... [2019-11-23 20:55:22,762 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:22" (1/1) ... [2019-11-23 20:55:22,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:22,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:22,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:22,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:22,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:22" (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:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:22,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:25,004 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:25,005 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:25,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:25 BoogieIcfgContainer [2019-11-23 20:55:25,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:25,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:25,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:25,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:25,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:21" (1/3) ... [2019-11-23 20:55:25,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524ab14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:25, skipping insertion in model container [2019-11-23 20:55:25,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:22" (2/3) ... [2019-11-23 20:55:25,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524ab14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:25, skipping insertion in model container [2019-11-23 20:55:25,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:25" (3/3) ... [2019-11-23 20:55:25,018 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label24.c [2019-11-23 20:55:25,029 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:25,039 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:25,051 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:25,097 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:25,097 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:25,097 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:25,097 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:25,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:25,098 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:25,098 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:25,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 20:55:25,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:25,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:25,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1612939027, now seen corresponding path program 1 times [2019-11-23 20:55:25,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:25,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477154464] [2019-11-23 20:55:25,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:25,983 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:25,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477154464] [2019-11-23 20:55:25,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:25,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:25,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645882899] [2019-11-23 20:55:25,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:25,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:26,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:26,016 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:55:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:28,296 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-11-23 20:55:28,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:28,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-23 20:55:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:28,322 INFO L225 Difference]: With dead ends: 1023 [2019-11-23 20:55:28,322 INFO L226 Difference]: Without dead ends: 654 [2019-11-23 20:55:28,329 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:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-11-23 20:55:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-11-23 20:55:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-11-23 20:55:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-11-23 20:55:28,411 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 191 [2019-11-23 20:55:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:28,413 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-11-23 20:55:28,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-11-23 20:55:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-23 20:55:28,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:28,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:28,418 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:28,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1561555348, now seen corresponding path program 1 times [2019-11-23 20:55:28,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:28,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896291643] [2019-11-23 20:55:28,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:28,520 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:28,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896291643] [2019-11-23 20:55:28,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:28,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:28,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871993661] [2019-11-23 20:55:28,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:28,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:28,524 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-11-23 20:55:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:29,706 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-11-23 20:55:29,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:29,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-23 20:55:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:29,714 INFO L225 Difference]: With dead ends: 1929 [2019-11-23 20:55:29,714 INFO L226 Difference]: Without dead ends: 1279 [2019-11-23 20:55:29,717 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:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-23 20:55:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-11-23 20:55:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-23 20:55:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1832 transitions. [2019-11-23 20:55:29,772 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1832 transitions. Word has length 199 [2019-11-23 20:55:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:29,772 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 1832 transitions. [2019-11-23 20:55:29,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1832 transitions. [2019-11-23 20:55:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 20:55:29,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:29,778 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:29,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:29,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:29,779 INFO L82 PathProgramCache]: Analyzing trace with hash -252433271, now seen corresponding path program 1 times [2019-11-23 20:55:29,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:29,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837969178] [2019-11-23 20:55:29,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:30,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837969178] [2019-11-23 20:55:30,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:30,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:30,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461452549] [2019-11-23 20:55:30,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:30,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:30,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:30,101 INFO L87 Difference]: Start difference. First operand 1265 states and 1832 transitions. Second operand 3 states. [2019-11-23 20:55:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,216 INFO L93 Difference]: Finished difference Result 3758 states and 5448 transitions. [2019-11-23 20:55:31,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-23 20:55:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,231 INFO L225 Difference]: With dead ends: 3758 [2019-11-23 20:55:31,232 INFO L226 Difference]: Without dead ends: 2495 [2019-11-23 20:55:31,234 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,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-11-23 20:55:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2493. [2019-11-23 20:55:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-23 20:55:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3402 transitions. [2019-11-23 20:55:31,290 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3402 transitions. Word has length 206 [2019-11-23 20:55:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,291 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 3402 transitions. [2019-11-23 20:55:31,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3402 transitions. [2019-11-23 20:55:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-23 20:55:31,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,300 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:31,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash -225243153, now seen corresponding path program 1 times [2019-11-23 20:55:31,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325992359] [2019-11-23 20:55:31,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:31,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325992359] [2019-11-23 20:55:31,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:31,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:31,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705455996] [2019-11-23 20:55:31,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:31,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:31,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:31,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:31,414 INFO L87 Difference]: Start difference. First operand 2493 states and 3402 transitions. Second operand 4 states. [2019-11-23 20:55:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:32,585 INFO L93 Difference]: Finished difference Result 4955 states and 6763 transitions. [2019-11-23 20:55:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:32,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-11-23 20:55:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:32,598 INFO L225 Difference]: With dead ends: 4955 [2019-11-23 20:55:32,598 INFO L226 Difference]: Without dead ends: 2464 [2019-11-23 20:55:32,602 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:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-11-23 20:55:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2019-11-23 20:55:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2019-11-23 20:55:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3263 transitions. [2019-11-23 20:55:32,651 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3263 transitions. Word has length 216 [2019-11-23 20:55:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:32,651 INFO L462 AbstractCegarLoop]: Abstraction has 2464 states and 3263 transitions. [2019-11-23 20:55:32,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3263 transitions. [2019-11-23 20:55:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 20:55:32,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:32,658 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:32,658 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1464925484, now seen corresponding path program 1 times [2019-11-23 20:55:32,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:32,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639562679] [2019-11-23 20:55:32,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:32,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639562679] [2019-11-23 20:55:32,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:32,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:32,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971606178] [2019-11-23 20:55:32,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:32,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:32,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:32,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:32,765 INFO L87 Difference]: Start difference. First operand 2464 states and 3263 transitions. Second operand 4 states. [2019-11-23 20:55:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:34,484 INFO L93 Difference]: Finished difference Result 9843 states and 13038 transitions. [2019-11-23 20:55:34,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:34,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-23 20:55:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:34,515 INFO L225 Difference]: With dead ends: 9843 [2019-11-23 20:55:34,516 INFO L226 Difference]: Without dead ends: 7381 [2019-11-23 20:55:34,521 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:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7381 states. [2019-11-23 20:55:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7381 to 7377. [2019-11-23 20:55:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-11-23 20:55:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9720 transitions. [2019-11-23 20:55:34,662 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9720 transitions. Word has length 218 [2019-11-23 20:55:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:34,663 INFO L462 AbstractCegarLoop]: Abstraction has 7377 states and 9720 transitions. [2019-11-23 20:55:34,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9720 transitions. [2019-11-23 20:55:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-23 20:55:34,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:34,677 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:34,678 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:34,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:34,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1826592161, now seen corresponding path program 1 times [2019-11-23 20:55:34,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:34,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383352696] [2019-11-23 20:55:34,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-23 20:55:34,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383352696] [2019-11-23 20:55:34,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:34,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:34,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035518648] [2019-11-23 20:55:34,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:34,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:34,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:34,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:34,836 INFO L87 Difference]: Start difference. First operand 7377 states and 9720 transitions. Second operand 3 states. [2019-11-23 20:55:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:35,900 INFO L93 Difference]: Finished difference Result 14758 states and 19450 transitions. [2019-11-23 20:55:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:35,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-23 20:55:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:35,924 INFO L225 Difference]: With dead ends: 14758 [2019-11-23 20:55:35,924 INFO L226 Difference]: Without dead ends: 7383 [2019-11-23 20:55:35,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2019-11-23 20:55:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 7377. [2019-11-23 20:55:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-11-23 20:55:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 8865 transitions. [2019-11-23 20:55:36,053 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 8865 transitions. Word has length 222 [2019-11-23 20:55:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 7377 states and 8865 transitions. [2019-11-23 20:55:36,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 8865 transitions. [2019-11-23 20:55:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 20:55:36,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:36,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1919299954, now seen corresponding path program 1 times [2019-11-23 20:55:36,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:36,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908043963] [2019-11-23 20:55:36,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:36,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908043963] [2019-11-23 20:55:36,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:36,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:36,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162830901] [2019-11-23 20:55:36,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:36,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:36,165 INFO L87 Difference]: Start difference. First operand 7377 states and 8865 transitions. Second operand 3 states. [2019-11-23 20:55:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:37,432 INFO L93 Difference]: Finished difference Result 21872 states and 26317 transitions. [2019-11-23 20:55:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:37,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-23 20:55:37,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:37,475 INFO L225 Difference]: With dead ends: 21872 [2019-11-23 20:55:37,475 INFO L226 Difference]: Without dead ends: 14497 [2019-11-23 20:55:37,484 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:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14497 states. [2019-11-23 20:55:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14497 to 14488. [2019-11-23 20:55:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14488 states. [2019-11-23 20:55:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14488 states to 14488 states and 17031 transitions. [2019-11-23 20:55:37,693 INFO L78 Accepts]: Start accepts. Automaton has 14488 states and 17031 transitions. Word has length 240 [2019-11-23 20:55:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:37,694 INFO L462 AbstractCegarLoop]: Abstraction has 14488 states and 17031 transitions. [2019-11-23 20:55:37,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14488 states and 17031 transitions. [2019-11-23 20:55:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 20:55:37,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:37,706 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash 237647221, now seen corresponding path program 1 times [2019-11-23 20:55:37,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:37,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965597276] [2019-11-23 20:55:37,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:37,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965597276] [2019-11-23 20:55:37,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:37,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:37,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373161153] [2019-11-23 20:55:37,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:37,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:37,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:37,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:37,865 INFO L87 Difference]: Start difference. First operand 14488 states and 17031 transitions. Second operand 4 states. [2019-11-23 20:55:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:39,233 INFO L93 Difference]: Finished difference Result 28974 states and 34060 transitions. [2019-11-23 20:55:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:39,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-23 20:55:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:39,259 INFO L225 Difference]: With dead ends: 28974 [2019-11-23 20:55:39,259 INFO L226 Difference]: Without dead ends: 14488 [2019-11-23 20:55:39,272 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:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14488 states. [2019-11-23 20:55:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14488 to 14488. [2019-11-23 20:55:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14488 states. [2019-11-23 20:55:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14488 states to 14488 states and 16609 transitions. [2019-11-23 20:55:39,477 INFO L78 Accepts]: Start accepts. Automaton has 14488 states and 16609 transitions. Word has length 245 [2019-11-23 20:55:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:39,478 INFO L462 AbstractCegarLoop]: Abstraction has 14488 states and 16609 transitions. [2019-11-23 20:55:39,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 14488 states and 16609 transitions. [2019-11-23 20:55:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-23 20:55:39,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:39,490 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, 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] [2019-11-23 20:55:39,490 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1556480726, now seen corresponding path program 1 times [2019-11-23 20:55:39,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:39,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670482006] [2019-11-23 20:55:39,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 20:55:39,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670482006] [2019-11-23 20:55:39,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:39,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:39,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853571625] [2019-11-23 20:55:39,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:39,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:39,593 INFO L87 Difference]: Start difference. First operand 14488 states and 16609 transitions. Second operand 3 states. [2019-11-23 20:55:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:40,868 INFO L93 Difference]: Finished difference Result 35718 states and 40926 transitions. [2019-11-23 20:55:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:40,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-11-23 20:55:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:40,898 INFO L225 Difference]: With dead ends: 35718 [2019-11-23 20:55:40,898 INFO L226 Difference]: Without dead ends: 21232 [2019-11-23 20:55:40,913 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:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21232 states. [2019-11-23 20:55:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21232 to 21227. [2019-11-23 20:55:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21227 states. [2019-11-23 20:55:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21227 states to 21227 states and 24282 transitions. [2019-11-23 20:55:41,214 INFO L78 Accepts]: Start accepts. Automaton has 21227 states and 24282 transitions. Word has length 253 [2019-11-23 20:55:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:41,215 INFO L462 AbstractCegarLoop]: Abstraction has 21227 states and 24282 transitions. [2019-11-23 20:55:41,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21227 states and 24282 transitions. [2019-11-23 20:55:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-23 20:55:41,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:41,237 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,237 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash 474797067, now seen corresponding path program 1 times [2019-11-23 20:55:41,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:41,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932783921] [2019-11-23 20:55:41,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 20:55:41,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932783921] [2019-11-23 20:55:41,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375312303] [2019-11-23 20:55:41,436 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:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:41,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:41,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:55:41,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:41,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-11-23 20:55:41,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892203945] [2019-11-23 20:55:41,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:41,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:41,844 INFO L87 Difference]: Start difference. First operand 21227 states and 24282 transitions. Second operand 3 states. [2019-11-23 20:55:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:42,810 INFO L93 Difference]: Finished difference Result 42470 states and 48598 transitions. [2019-11-23 20:55:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:42,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-11-23 20:55:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:42,848 INFO L225 Difference]: With dead ends: 42470 [2019-11-23 20:55:42,848 INFO L226 Difference]: Without dead ends: 21245 [2019-11-23 20:55:42,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:42,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21245 states. [2019-11-23 20:55:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21245 to 20618. [2019-11-23 20:55:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20618 states. [2019-11-23 20:55:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20618 states to 20618 states and 23185 transitions. [2019-11-23 20:55:43,219 INFO L78 Accepts]: Start accepts. Automaton has 20618 states and 23185 transitions. Word has length 260 [2019-11-23 20:55:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:43,220 INFO L462 AbstractCegarLoop]: Abstraction has 20618 states and 23185 transitions. [2019-11-23 20:55:43,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 20618 states and 23185 transitions. [2019-11-23 20:55:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-23 20:55:43,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:43,238 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:43,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:43,452 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1666597647, now seen corresponding path program 1 times [2019-11-23 20:55:43,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:43,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640940588] [2019-11-23 20:55:43,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 20:55:43,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640940588] [2019-11-23 20:55:43,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856071580] [2019-11-23 20:55:43,675 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:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:44,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:55:44,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-23 20:55:44,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:44,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:55:44,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079273467] [2019-11-23 20:55:44,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:44,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:44,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:44,688 INFO L87 Difference]: Start difference. First operand 20618 states and 23185 transitions. Second operand 3 states. [2019-11-23 20:55:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:45,811 INFO L93 Difference]: Finished difference Result 55276 states and 62224 transitions. [2019-11-23 20:55:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:45,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-23 20:55:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:45,856 INFO L225 Difference]: With dead ends: 55276 [2019-11-23 20:55:45,856 INFO L226 Difference]: Without dead ends: 34660 [2019-11-23 20:55:45,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34660 states. [2019-11-23 20:55:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34660 to 34625. [2019-11-23 20:55:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34625 states. [2019-11-23 20:55:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34625 states to 34625 states and 38656 transitions. [2019-11-23 20:55:46,533 INFO L78 Accepts]: Start accepts. Automaton has 34625 states and 38656 transitions. Word has length 270 [2019-11-23 20:55:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:46,534 INFO L462 AbstractCegarLoop]: Abstraction has 34625 states and 38656 transitions. [2019-11-23 20:55:46,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34625 states and 38656 transitions. [2019-11-23 20:55:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-23 20:55:46,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:46,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:46,771 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1954846457, now seen corresponding path program 1 times [2019-11-23 20:55:46,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:46,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074176740] [2019-11-23 20:55:46,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:47,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074176740] [2019-11-23 20:55:47,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000379753] [2019-11-23 20:55:47,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:47,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:47,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:47,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:47,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-23 20:55:47,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973099465] [2019-11-23 20:55:47,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:47,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:55:47,341 INFO L87 Difference]: Start difference. First operand 34625 states and 38656 transitions. Second operand 3 states. [2019-11-23 20:55:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:48,795 INFO L93 Difference]: Finished difference Result 69874 states and 77969 transitions. [2019-11-23 20:55:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:48,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-11-23 20:55:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:48,797 INFO L225 Difference]: With dead ends: 69874 [2019-11-23 20:55:48,797 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:55:48,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 283 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:55:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:55:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:55:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:55:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:55:48,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-11-23 20:55:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:48,820 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:55:48,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:55:48,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:55:49,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:49,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:55:49,193 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 55 [2019-11-23 20:55:49,328 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 55 [2019-11-23 20:55:49,750 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-23 20:55:50,239 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-23 20:55:50,243 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:55:50,243 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:55:50,244 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,244 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,244 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,244 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,244 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,245 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,245 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,245 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:55:50,245 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,245 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:55:50,246 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:55:50,246 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,246 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,246 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,247 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:55:50,248 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,249 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,250 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,251 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,252 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:55:50,253 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,254 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,255 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:55:50,256 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,257 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,258 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,259 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:55:50,260 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,261 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,262 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse8 (= ~a26~0 1)) (.cse9 (<= ~a12~0 0)) (.cse1 (= 1 ~a3~0)) (.cse6 (= 1 ~a6~0)) (.cse10 (not (= 0 ~a3~0))) (.cse7 (= ~a27~0 1)) (.cse5 (<= ~a3~0 0)) (.cse0 (<= ~a6~0 0)) (.cse2 (= 1 ~a5~0)) (.cse3 (= ~a12~0 1)) (.cse4 (<= ~a27~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse7 .cse2 .cse3 .cse8) (and .cse7 .cse2 .cse6 .cse3 .cse8) (and .cse2 .cse6 .cse3 .cse8 .cse4) (and .cse0 .cse9 .cse2 .cse8 .cse4) (and .cse0 .cse9 .cse7 .cse2) (and .cse7 .cse2 .cse6 .cse3 (= ~a15~0 1)) (and .cse10 .cse0 .cse9 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse5 .cse9 .cse2 .cse6) (and .cse10 .cse7 .cse2 .cse6 .cse3) (and .cse9 .cse2 .cse6 .cse4) (and .cse9 .cse7 .cse2 .cse6) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and (= ~a10~0 1) .cse2 .cse6 .cse3 (not (= 1 ~a7~0)) .cse4) (and .cse10 .cse0 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 .cse4))) [2019-11-23 20:55:50,262 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,262 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,262 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1608) no Hoare annotation was computed. [2019-11-23 20:55:50,263 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:55:50,264 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,265 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:55:50,266 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,267 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse8 (= ~a26~0 1)) (.cse9 (<= ~a12~0 0)) (.cse1 (= 1 ~a3~0)) (.cse6 (= 1 ~a6~0)) (.cse10 (not (= 0 ~a3~0))) (.cse7 (= ~a27~0 1)) (.cse5 (<= ~a3~0 0)) (.cse0 (<= ~a6~0 0)) (.cse2 (= 1 ~a5~0)) (.cse3 (= ~a12~0 1)) (.cse4 (<= ~a27~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse7 .cse2 .cse3 .cse8) (and .cse7 .cse2 .cse6 .cse3 .cse8) (and .cse2 .cse6 .cse3 .cse8 .cse4) (and .cse0 .cse9 .cse2 .cse8 .cse4) (and .cse0 .cse9 .cse7 .cse2) (and .cse7 .cse2 .cse6 .cse3 (= ~a15~0 1)) (and .cse10 .cse0 .cse9 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse5 .cse9 .cse2 .cse6) (and .cse10 .cse7 .cse2 .cse6 .cse3) (and .cse9 .cse2 .cse6 .cse4) (and .cse9 .cse7 .cse2 .cse6) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and (= ~a10~0 1) .cse2 .cse6 .cse3 (not (= 1 ~a7~0)) .cse4) (and .cse10 .cse0 .cse7 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 .cse4))) [2019-11-23 20:55:50,267 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,267 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,267 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,267 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,267 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,268 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,269 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,270 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,271 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:55:50,272 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,273 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,274 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:55:50,275 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:55:50,276 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:55:50,277 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,278 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:55:50,279 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,280 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,281 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:55:50,282 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:55:50,282 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,282 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:55:50,282 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:55:50,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:55:50 BoogieIcfgContainer [2019-11-23 20:55:50,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:55:50,315 INFO L168 Benchmark]: Toolchain (without parser) took 29025.00 ms. Allocated memory was 144.7 MB in the beginning and 955.8 MB in the end (delta: 811.1 MB). Free memory was 96.3 MB in the beginning and 500.2 MB in the end (delta: -403.8 MB). Peak memory consumption was 407.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:55:50,315 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 20:55:50,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1168.06 ms. Allocated memory was 144.7 MB in the beginning and 205.5 MB in the end (delta: 60.8 MB). Free memory was 95.9 MB in the beginning and 127.7 MB in the end (delta: -31.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:55:50,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.18 ms. Allocated memory is still 205.5 MB. Free memory was 127.7 MB in the beginning and 113.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:55:50,317 INFO L168 Benchmark]: Boogie Preprocessor took 153.92 ms. Allocated memory is still 205.5 MB. Free memory was 113.0 MB in the beginning and 101.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:55:50,318 INFO L168 Benchmark]: RCFGBuilder took 2228.62 ms. Allocated memory was 205.5 MB in the beginning and 269.5 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 104.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:55:50,319 INFO L168 Benchmark]: TraceAbstraction took 25304.08 ms. Allocated memory was 269.5 MB in the beginning and 955.8 MB in the end (delta: 686.3 MB). Free memory was 104.9 MB in the beginning and 500.2 MB in the end (delta: -395.3 MB). Peak memory consumption was 291.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:55:50,323 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.37 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1168.06 ms. Allocated memory was 144.7 MB in the beginning and 205.5 MB in the end (delta: 60.8 MB). Free memory was 95.9 MB in the beginning and 127.7 MB in the end (delta: -31.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 163.18 ms. Allocated memory is still 205.5 MB. Free memory was 127.7 MB in the beginning and 113.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.92 ms. Allocated memory is still 205.5 MB. Free memory was 113.0 MB in the beginning and 101.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2228.62 ms. Allocated memory was 205.5 MB in the beginning and 269.5 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 104.9 MB in the end (delta: -3.4 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25304.08 ms. Allocated memory was 269.5 MB in the beginning and 955.8 MB in the end (delta: 686.3 MB). Free memory was 104.9 MB in the beginning and 500.2 MB in the end (delta: -395.3 MB). Peak memory consumption was 291.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1608]: 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: ((((((((((((((((((((a6 <= 0 && 1 == a3) && 1 == a5) && a12 == 1) && a27 <= 0) || ((((a3 <= 0 && 1 == a5) && 1 == a6) && a12 == 1) && a27 <= 0)) || ((((a6 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a26 == 1)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && a26 == 1)) || ((((1 == a5 && 1 == a6) && a12 == 1) && a26 == 1) && a27 <= 0)) || ((((a6 <= 0 && a12 <= 0) && 1 == a5) && a26 == 1) && a27 <= 0)) || (((a6 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && a15 == 1)) || ((((!(0 == a3) && a6 <= 0) && a12 <= 0) && 1 == a5) && a27 <= 0)) || ((((a6 <= 0 && 1 == a5) && a12 == 1) && a26 == 1) && a27 <= 0)) || (((a3 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6)) || ((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1)) || (((a12 <= 0 && 1 == a5) && 1 == a6) && a27 <= 0)) || (((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6)) || ((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && a27 <= 0)) || (((((a10 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a27 <= 0)) || ((((!(0 == a3) && a6 <= 0) && a27 == 1) && 1 == a5) && a12 == 1)) || ((((a3 <= 0 && a6 <= 0) && 1 == a5) && a12 == 1) && a27 <= 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a6 <= 0 && 1 == a3) && 1 == a5) && a12 == 1) && a27 <= 0) || ((((a3 <= 0 && 1 == a5) && 1 == a6) && a12 == 1) && a27 <= 0)) || ((((a6 <= 0 && a27 == 1) && 1 == a5) && a12 == 1) && a26 == 1)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && a26 == 1)) || ((((1 == a5 && 1 == a6) && a12 == 1) && a26 == 1) && a27 <= 0)) || ((((a6 <= 0 && a12 <= 0) && 1 == a5) && a26 == 1) && a27 <= 0)) || (((a6 <= 0 && a12 <= 0) && a27 == 1) && 1 == a5)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && a15 == 1)) || ((((!(0 == a3) && a6 <= 0) && a12 <= 0) && 1 == a5) && a27 <= 0)) || ((((a6 <= 0 && 1 == a5) && a12 == 1) && a26 == 1) && a27 <= 0)) || (((a3 <= 0 && a12 <= 0) && 1 == a5) && 1 == a6)) || ((((!(0 == a3) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1)) || (((a12 <= 0 && 1 == a5) && 1 == a6) && a27 <= 0)) || (((a12 <= 0 && a27 == 1) && 1 == a5) && 1 == a6)) || ((((1 == a3 && 1 == a5) && 1 == a6) && a12 == 1) && a27 <= 0)) || (((((a10 == 1 && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a27 <= 0)) || ((((!(0 == a3) && a6 <= 0) && a27 == 1) && 1 == a5) && a12 == 1)) || ((((a3 <= 0 && a6 <= 0) && 1 == a5) && a12 == 1) && a27 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 25.1s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 2294 SDtfs, 3303 SDslu, 295 SDs, 0 SdLazy, 8498 SolverSat, 1746 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 823 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34625occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 704 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 352 NumberOfFragments, 569 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7204 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 354 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3618 NumberOfCodeBlocks, 3618 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3603 ConstructedInterpolants, 0 QuantifiedInterpolants, 1933145 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1507 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 1099/1113 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...