/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_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:18,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:18,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:18,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:18,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:18,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:18,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:18,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:18,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:18,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:18,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:18,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:18,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:18,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:18,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:18,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:18,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:18,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:18,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:18,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:18,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:18,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:18,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:18,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:18,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:18,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:18,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:18,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:18,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:18,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:18,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:18,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:18,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:18,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:18,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:18,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:18,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:18,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:18,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:18,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:18,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:18,577 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:18,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:18,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:18,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:18,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:18,593 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:18,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:18,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:18,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:18,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:18,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:18,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:18,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:18,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:18,595 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:18,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:18,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:18,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:18,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:18,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:18,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:18,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:18,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:18,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:18,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:18,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:18,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:18,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:18,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:18,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:18,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:18,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:18,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:18,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:18,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:18,902 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:18,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label22.c [2019-11-23 20:55:18,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738095b56/b186fdc8e873457ea0d2036ba49a1e1e/FLAGf1503ee5a [2019-11-23 20:55:19,634 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:19,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label22.c [2019-11-23 20:55:19,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738095b56/b186fdc8e873457ea0d2036ba49a1e1e/FLAGf1503ee5a [2019-11-23 20:55:19,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738095b56/b186fdc8e873457ea0d2036ba49a1e1e [2019-11-23 20:55:19,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:19,894 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:19,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:19,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:19,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:19,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7142d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19, skipping insertion in model container [2019-11-23 20:55:19,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:19,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:19,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:20,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:20,800 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:21,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:21,233 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:21,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:21 WrapperNode [2019-11-23 20:55:21,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:21,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:21,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:21,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:21,245 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:21" (1/1) ... [2019-11-23 20:55:21,291 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:21" (1/1) ... [2019-11-23 20:55:21,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:21,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:21,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:21,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:21,409 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:21" (1/1) ... [2019-11-23 20:55:21,409 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:21" (1/1) ... [2019-11-23 20:55:21,416 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:21" (1/1) ... [2019-11-23 20:55:21,416 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:21" (1/1) ... [2019-11-23 20:55:21,461 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:21" (1/1) ... [2019-11-23 20:55:21,475 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:21" (1/1) ... [2019-11-23 20:55:21,492 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:21" (1/1) ... [2019-11-23 20:55:21,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:21,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:21,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:21,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:21,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:21" (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:21,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:21,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:23,693 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:23,693 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:23,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:23 BoogieIcfgContainer [2019-11-23 20:55:23,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:23,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:23,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:23,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:23,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:19" (1/3) ... [2019-11-23 20:55:23,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6ac2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:23, skipping insertion in model container [2019-11-23 20:55:23,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:21" (2/3) ... [2019-11-23 20:55:23,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6ac2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:23, skipping insertion in model container [2019-11-23 20:55:23,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:23" (3/3) ... [2019-11-23 20:55:23,706 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label22.c [2019-11-23 20:55:23,717 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:23,729 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:23,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:23,787 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:23,788 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:23,788 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:23,788 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:23,788 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:23,789 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:23,789 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:23,789 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 20:55:23,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:23,843 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] [2019-11-23 20:55:23,843 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1133598669, now seen corresponding path program 1 times [2019-11-23 20:55:23,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:23,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332214937] [2019-11-23 20:55:23,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:24,751 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:24,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332214937] [2019-11-23 20:55:24,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:24,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:24,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237261668] [2019-11-23 20:55:24,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:24,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:24,779 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-23 20:55:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:26,227 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-23 20:55:26,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:26,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 20:55:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:26,250 INFO L225 Difference]: With dead ends: 829 [2019-11-23 20:55:26,251 INFO L226 Difference]: Without dead ends: 463 [2019-11-23 20:55:26,256 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:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-23 20:55:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-23 20:55:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-23 20:55:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-23 20:55:26,345 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 167 [2019-11-23 20:55:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:26,347 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-23 20:55:26,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-23 20:55:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 20:55:26,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:26,352 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:55:26,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1783223651, now seen corresponding path program 1 times [2019-11-23 20:55:26,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:26,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271180804] [2019-11-23 20:55:26,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:26,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271180804] [2019-11-23 20:55:26,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:26,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:26,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508960605] [2019-11-23 20:55:26,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:26,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:26,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:26,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:26,503 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-23 20:55:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:28,289 INFO L93 Difference]: Finished difference Result 1737 states and 2828 transitions. [2019-11-23 20:55:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:28,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-23 20:55:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:28,298 INFO L225 Difference]: With dead ends: 1737 [2019-11-23 20:55:28,298 INFO L226 Difference]: Without dead ends: 1290 [2019-11-23 20:55:28,301 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,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-11-23 20:55:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 859. [2019-11-23 20:55:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-23 20:55:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-11-23 20:55:28,342 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 172 [2019-11-23 20:55:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:28,342 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-11-23 20:55:28,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-11-23 20:55:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-23 20:55:28,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:28,349 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,350 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash 194017064, now seen corresponding path program 1 times [2019-11-23 20:55:28,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:28,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840194948] [2019-11-23 20:55:28,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:28,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840194948] [2019-11-23 20:55:28,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:28,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:28,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948491016] [2019-11-23 20:55:28,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:28,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:28,554 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-11-23 20:55:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:30,429 INFO L93 Difference]: Finished difference Result 3344 states and 5142 transitions. [2019-11-23 20:55:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:30,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-23 20:55:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:30,445 INFO L225 Difference]: With dead ends: 3344 [2019-11-23 20:55:30,446 INFO L226 Difference]: Without dead ends: 2487 [2019-11-23 20:55:30,448 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:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-11-23 20:55:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2485. [2019-11-23 20:55:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2019-11-23 20:55:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3446 transitions. [2019-11-23 20:55:30,545 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3446 transitions. Word has length 174 [2019-11-23 20:55:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:30,546 INFO L462 AbstractCegarLoop]: Abstraction has 2485 states and 3446 transitions. [2019-11-23 20:55:30,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3446 transitions. [2019-11-23 20:55:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-23 20:55:30,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:30,557 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:30,557 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2000740269, now seen corresponding path program 1 times [2019-11-23 20:55:30,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:30,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031866529] [2019-11-23 20:55:30,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:55:30,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031866529] [2019-11-23 20:55:30,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:30,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:30,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936367309] [2019-11-23 20:55:30,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:30,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:30,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:30,666 INFO L87 Difference]: Start difference. First operand 2485 states and 3446 transitions. Second operand 3 states. [2019-11-23 20:55:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,100 INFO L93 Difference]: Finished difference Result 7439 states and 10319 transitions. [2019-11-23 20:55:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-23 20:55:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,122 INFO L225 Difference]: With dead ends: 7439 [2019-11-23 20:55:31,122 INFO L226 Difference]: Without dead ends: 4956 [2019-11-23 20:55:31,126 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:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-11-23 20:55:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4953. [2019-11-23 20:55:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4953 states. [2019-11-23 20:55:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 6860 transitions. [2019-11-23 20:55:31,219 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 6860 transitions. Word has length 187 [2019-11-23 20:55:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,220 INFO L462 AbstractCegarLoop]: Abstraction has 4953 states and 6860 transitions. [2019-11-23 20:55:31,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 6860 transitions. [2019-11-23 20:55:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-23 20:55:31,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,228 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:31,228 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1161579327, now seen corresponding path program 1 times [2019-11-23 20:55:31,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804921907] [2019-11-23 20:55:31,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:55:31,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804921907] [2019-11-23 20:55:31,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:31,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:31,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293224399] [2019-11-23 20:55:31,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:31,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:31,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:31,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:31,319 INFO L87 Difference]: Start difference. First operand 4953 states and 6860 transitions. Second operand 3 states. [2019-11-23 20:55:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:31,920 INFO L93 Difference]: Finished difference Result 9866 states and 13666 transitions. [2019-11-23 20:55:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:31,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-23 20:55:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:31,939 INFO L225 Difference]: With dead ends: 9866 [2019-11-23 20:55:31,939 INFO L226 Difference]: Without dead ends: 4915 [2019-11-23 20:55:31,945 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:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-11-23 20:55:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4915. [2019-11-23 20:55:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4915 states. [2019-11-23 20:55:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 6676 transitions. [2019-11-23 20:55:32,024 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 6676 transitions. Word has length 195 [2019-11-23 20:55:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:32,024 INFO L462 AbstractCegarLoop]: Abstraction has 4915 states and 6676 transitions. [2019-11-23 20:55:32,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 6676 transitions. [2019-11-23 20:55:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 20:55:32,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:32,031 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:32,031 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:32,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1084371729, now seen corresponding path program 1 times [2019-11-23 20:55:32,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:32,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436596579] [2019-11-23 20:55:32,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:32,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436596579] [2019-11-23 20:55:32,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:32,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:32,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114394044] [2019-11-23 20:55:32,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:32,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:32,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:32,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:32,212 INFO L87 Difference]: Start difference. First operand 4915 states and 6676 transitions. Second operand 5 states. [2019-11-23 20:55:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:34,276 INFO L93 Difference]: Finished difference Result 11066 states and 15191 transitions. [2019-11-23 20:55:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:34,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 205 [2019-11-23 20:55:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:34,301 INFO L225 Difference]: With dead ends: 11066 [2019-11-23 20:55:34,301 INFO L226 Difference]: Without dead ends: 6153 [2019-11-23 20:55:34,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2019-11-23 20:55:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 5321. [2019-11-23 20:55:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5321 states. [2019-11-23 20:55:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 7222 transitions. [2019-11-23 20:55:34,404 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 7222 transitions. Word has length 205 [2019-11-23 20:55:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:34,404 INFO L462 AbstractCegarLoop]: Abstraction has 5321 states and 7222 transitions. [2019-11-23 20:55:34,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 7222 transitions. [2019-11-23 20:55:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-23 20:55:34,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:34,413 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 227764771, now seen corresponding path program 1 times [2019-11-23 20:55:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:34,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2211067] [2019-11-23 20:55:34,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-23 20:55:34,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2211067] [2019-11-23 20:55:34,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571627827] [2019-11-23 20:55:34,521 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:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:34,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:55:34,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 20:55:34,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:34,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:55:34,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197544491] [2019-11-23 20:55:34,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:34,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:34,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:34,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:34,970 INFO L87 Difference]: Start difference. First operand 5321 states and 7222 transitions. Second operand 3 states. [2019-11-23 20:55:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:35,317 INFO L93 Difference]: Finished difference Result 15957 states and 21660 transitions. [2019-11-23 20:55:35,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:35,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-11-23 20:55:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:35,363 INFO L225 Difference]: With dead ends: 15957 [2019-11-23 20:55:35,364 INFO L226 Difference]: Without dead ends: 10638 [2019-11-23 20:55:35,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 239 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:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10638 states. [2019-11-23 20:55:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10638 to 10636. [2019-11-23 20:55:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10636 states. [2019-11-23 20:55:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 14415 transitions. [2019-11-23 20:55:35,521 INFO L78 Accepts]: Start accepts. Automaton has 10636 states and 14415 transitions. Word has length 239 [2019-11-23 20:55:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:35,522 INFO L462 AbstractCegarLoop]: Abstraction has 10636 states and 14415 transitions. [2019-11-23 20:55:35,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10636 states and 14415 transitions. [2019-11-23 20:55:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 20:55:35,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:35,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:55:35,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1616170837, now seen corresponding path program 1 times [2019-11-23 20:55:35,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:35,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296053894] [2019-11-23 20:55:35,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:35,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296053894] [2019-11-23 20:55:35,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:35,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:35,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400841507] [2019-11-23 20:55:35,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:35,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:35,903 INFO L87 Difference]: Start difference. First operand 10636 states and 14415 transitions. Second operand 3 states. [2019-11-23 20:55:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:37,078 INFO L93 Difference]: Finished difference Result 31442 states and 42521 transitions. [2019-11-23 20:55:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:37,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-23 20:55:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:37,116 INFO L225 Difference]: With dead ends: 31442 [2019-11-23 20:55:37,116 INFO L226 Difference]: Without dead ends: 20808 [2019-11-23 20:55:37,130 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,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20808 states. [2019-11-23 20:55:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20808 to 20804. [2019-11-23 20:55:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20804 states. [2019-11-23 20:55:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20804 states to 20804 states and 26387 transitions. [2019-11-23 20:55:37,392 INFO L78 Accepts]: Start accepts. Automaton has 20804 states and 26387 transitions. Word has length 240 [2019-11-23 20:55:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:37,392 INFO L462 AbstractCegarLoop]: Abstraction has 20804 states and 26387 transitions. [2019-11-23 20:55:37,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20804 states and 26387 transitions. [2019-11-23 20:55:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-23 20:55:37,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:37,414 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:55:37,415 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash -915409615, now seen corresponding path program 1 times [2019-11-23 20:55:37,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:37,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470030936] [2019-11-23 20:55:37,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:37,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470030936] [2019-11-23 20:55:37,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:37,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:37,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134816403] [2019-11-23 20:55:37,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:37,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:37,908 INFO L87 Difference]: Start difference. First operand 20804 states and 26387 transitions. Second operand 4 states. [2019-11-23 20:55:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:39,633 INFO L93 Difference]: Finished difference Result 67013 states and 84831 transitions. [2019-11-23 20:55:39,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:39,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-23 20:55:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:39,720 INFO L225 Difference]: With dead ends: 67013 [2019-11-23 20:55:39,721 INFO L226 Difference]: Without dead ends: 46211 [2019-11-23 20:55:39,749 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,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46211 states. [2019-11-23 20:55:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46211 to 36029. [2019-11-23 20:55:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36029 states. [2019-11-23 20:55:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36029 states to 36029 states and 44359 transitions. [2019-11-23 20:55:41,229 INFO L78 Accepts]: Start accepts. Automaton has 36029 states and 44359 transitions. Word has length 245 [2019-11-23 20:55:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:41,230 INFO L462 AbstractCegarLoop]: Abstraction has 36029 states and 44359 transitions. [2019-11-23 20:55:41,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36029 states and 44359 transitions. [2019-11-23 20:55:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-23 20:55:41,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:41,264 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash 752568515, now seen corresponding path program 1 times [2019-11-23 20:55:41,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:41,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476076686] [2019-11-23 20:55:41,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:55:41,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476076686] [2019-11-23 20:55:41,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:41,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:41,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312906684] [2019-11-23 20:55:41,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:41,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:41,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:41,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:41,381 INFO L87 Difference]: Start difference. First operand 36029 states and 44359 transitions. Second operand 4 states. [2019-11-23 20:55:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:42,837 INFO L93 Difference]: Finished difference Result 71650 states and 88069 transitions. [2019-11-23 20:55:42,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:42,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-11-23 20:55:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:42,902 INFO L225 Difference]: With dead ends: 71650 [2019-11-23 20:55:43,170 INFO L226 Difference]: Without dead ends: 35623 [2019-11-23 20:55:43,196 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:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35623 states. [2019-11-23 20:55:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35623 to 35623. [2019-11-23 20:55:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35623 states. [2019-11-23 20:55:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35623 states to 35623 states and 41422 transitions. [2019-11-23 20:55:43,621 INFO L78 Accepts]: Start accepts. Automaton has 35623 states and 41422 transitions. Word has length 266 [2019-11-23 20:55:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:43,621 INFO L462 AbstractCegarLoop]: Abstraction has 35623 states and 41422 transitions. [2019-11-23 20:55:43,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35623 states and 41422 transitions. [2019-11-23 20:55:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-23 20:55:43,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:43,654 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,655 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1942509672, now seen corresponding path program 1 times [2019-11-23 20:55:43,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:43,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111313581] [2019-11-23 20:55:43,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:55:43,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111313581] [2019-11-23 20:55:43,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:43,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:43,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589717716] [2019-11-23 20:55:43,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:43,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:43,789 INFO L87 Difference]: Start difference. First operand 35623 states and 41422 transitions. Second operand 4 states. [2019-11-23 20:55:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:46,064 INFO L93 Difference]: Finished difference Result 132704 states and 154476 transitions. [2019-11-23 20:55:46,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:46,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-23 20:55:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:46,174 INFO L225 Difference]: With dead ends: 132704 [2019-11-23 20:55:46,174 INFO L226 Difference]: Without dead ends: 97083 [2019-11-23 20:55:46,210 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:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97083 states. [2019-11-23 20:55:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97083 to 97081. [2019-11-23 20:55:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97081 states. [2019-11-23 20:55:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97081 states to 97081 states and 112835 transitions. [2019-11-23 20:55:48,390 INFO L78 Accepts]: Start accepts. Automaton has 97081 states and 112835 transitions. Word has length 268 [2019-11-23 20:55:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:48,390 INFO L462 AbstractCegarLoop]: Abstraction has 97081 states and 112835 transitions. [2019-11-23 20:55:48,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 97081 states and 112835 transitions. [2019-11-23 20:55:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-23 20:55:48,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:48,416 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,416 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash 962018805, now seen corresponding path program 1 times [2019-11-23 20:55:48,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:48,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484480803] [2019-11-23 20:55:48,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-23 20:55:48,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484480803] [2019-11-23 20:55:48,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:48,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:48,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005816863] [2019-11-23 20:55:48,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:48,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:48,517 INFO L87 Difference]: Start difference. First operand 97081 states and 112835 transitions. Second operand 3 states. [2019-11-23 20:55:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:50,579 INFO L93 Difference]: Finished difference Result 194184 states and 225710 transitions. [2019-11-23 20:55:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:50,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-23 20:55:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:50,695 INFO L225 Difference]: With dead ends: 194184 [2019-11-23 20:55:50,695 INFO L226 Difference]: Without dead ends: 97105 [2019-11-23 20:55:50,749 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:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97105 states. [2019-11-23 20:55:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97105 to 94645. [2019-11-23 20:55:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94645 states. [2019-11-23 20:55:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94645 states to 94645 states and 105258 transitions. [2019-11-23 20:55:53,708 INFO L78 Accepts]: Start accepts. Automaton has 94645 states and 105258 transitions. Word has length 272 [2019-11-23 20:55:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:53,709 INFO L462 AbstractCegarLoop]: Abstraction has 94645 states and 105258 transitions. [2019-11-23 20:55:53,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 94645 states and 105258 transitions. [2019-11-23 20:55:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-23 20:55:53,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:53,719 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 20:55:53,719 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash 853434924, now seen corresponding path program 1 times [2019-11-23 20:55:53,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:53,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339032126] [2019-11-23 20:55:53,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-23 20:55:53,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339032126] [2019-11-23 20:55:53,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:53,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:53,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506012023] [2019-11-23 20:55:53,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:53,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:53,839 INFO L87 Difference]: Start difference. First operand 94645 states and 105258 transitions. Second operand 3 states. [2019-11-23 20:55:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:55,174 INFO L93 Difference]: Finished difference Result 187091 states and 207918 transitions. [2019-11-23 20:55:55,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:55,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-23 20:55:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:55,287 INFO L225 Difference]: With dead ends: 187091 [2019-11-23 20:55:55,287 INFO L226 Difference]: Without dead ends: 92448 [2019-11-23 20:55:55,339 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:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92448 states. [2019-11-23 20:55:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92448 to 92412. [2019-11-23 20:55:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92412 states. [2019-11-23 20:55:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92412 states to 92412 states and 100986 transitions. [2019-11-23 20:55:56,586 INFO L78 Accepts]: Start accepts. Automaton has 92412 states and 100986 transitions. Word has length 300 [2019-11-23 20:55:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:56,586 INFO L462 AbstractCegarLoop]: Abstraction has 92412 states and 100986 transitions. [2019-11-23 20:55:56,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92412 states and 100986 transitions. [2019-11-23 20:55:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-23 20:55:56,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:56,597 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,597 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1530237930, now seen corresponding path program 1 times [2019-11-23 20:55:56,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:56,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953330442] [2019-11-23 20:55:56,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-23 20:55:56,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953330442] [2019-11-23 20:55:56,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:56,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:56,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299543897] [2019-11-23 20:55:56,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:56,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:56,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:56,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:56,726 INFO L87 Difference]: Start difference. First operand 92412 states and 100986 transitions. Second operand 3 states. [2019-11-23 20:55:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:58,689 INFO L93 Difference]: Finished difference Result 228010 states and 249373 transitions. [2019-11-23 20:55:58,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:58,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-11-23 20:55:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:58,812 INFO L225 Difference]: With dead ends: 228010 [2019-11-23 20:55:58,812 INFO L226 Difference]: Without dead ends: 135600 [2019-11-23 20:55:58,859 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:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135600 states. [2019-11-23 20:56:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135600 to 135582. [2019-11-23 20:56:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135582 states. [2019-11-23 20:56:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135582 states to 135582 states and 148241 transitions. [2019-11-23 20:56:00,583 INFO L78 Accepts]: Start accepts. Automaton has 135582 states and 148241 transitions. Word has length 303 [2019-11-23 20:56:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:00,583 INFO L462 AbstractCegarLoop]: Abstraction has 135582 states and 148241 transitions. [2019-11-23 20:56:00,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 135582 states and 148241 transitions. [2019-11-23 20:56:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-23 20:56:00,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:00,602 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:00,602 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:00,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2085834207, now seen corresponding path program 1 times [2019-11-23 20:56:00,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:00,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102799315] [2019-11-23 20:56:00,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-23 20:56:00,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102799315] [2019-11-23 20:56:00,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535047770] [2019-11-23 20:56:00,777 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:56:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:00,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:56:00,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:56:01,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:01,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:56:01,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739496318] [2019-11-23 20:56:01,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:01,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:56:01,114 INFO L87 Difference]: Start difference. First operand 135582 states and 148241 transitions. Second operand 3 states. [2019-11-23 20:56:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:03,291 INFO L93 Difference]: Finished difference Result 307400 states and 337192 transitions. [2019-11-23 20:56:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:03,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-23 20:56:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:03,292 INFO L225 Difference]: With dead ends: 307400 [2019-11-23 20:56:03,292 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:56:03,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 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:56:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:56:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:56:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:56:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:56:03,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2019-11-23 20:56:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:03,364 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:56:03,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:56:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:56:03,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:03,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:56:08,528 WARN L192 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 1059 DAG size of output: 347 [2019-11-23 20:56:11,415 WARN L192 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 1059 DAG size of output: 347 [2019-11-23 20:56:14,233 WARN L192 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 345 DAG size of output: 56 [2019-11-23 20:56:17,058 WARN L192 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 345 DAG size of output: 56 [2019-11-23 20:56:17,063 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:56:17,063 INFO L444 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-23 20:56:17,063 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,063 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,063 INFO L444 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,063 INFO L444 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,064 INFO L444 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,064 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,064 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,064 INFO L444 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-23 20:56:17,064 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,064 INFO L444 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-23 20:56:17,065 INFO L444 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-23 20:56:17,065 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,065 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,065 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,065 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,066 INFO L444 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:56:17,066 INFO L444 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-23 20:56:17,066 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,066 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,066 INFO L444 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,066 INFO L444 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,067 INFO L444 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,068 INFO L444 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,069 INFO L444 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-23 20:56:17,070 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-23 20:56:17,071 INFO L444 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,072 INFO L444 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-23 20:56:17,073 INFO L444 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,074 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,075 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-23 20:56:17,076 INFO L444 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-23 20:56:17,077 INFO L444 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-23 20:56:17,077 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,077 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,077 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,077 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse4 (= ~a12~0 1))) (let ((.cse12 (= ~a16~0 1)) (.cse11 (not (= 0 ~a3~0))) (.cse5 (<= ~a6~0 0)) (.cse0 (<= ~a3~0 0)) (.cse7 (= 1 ~a3~0)) (.cse9 (<= ~a20~0 0)) (.cse8 (not .cse4)) (.cse3 (= ~a11~0 1)) (.cse6 (= ~a27~0 1)) (.cse1 (= 1 ~a5~0)) (.cse2 (= 1 ~a6~0)) (.cse10 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse6 .cse1 .cse4) (and .cse7 .cse1 .cse4) (and .cse6 .cse1 .cse8 .cse9) (and .cse7 .cse1 .cse10) (and .cse0 .cse5 .cse1 .cse4) (and .cse11 .cse1 .cse2 .cse8) (and .cse5 .cse1 .cse3 .cse10 .cse12 (<= ~a27~0 0)) (and .cse11 .cse1 .cse4 .cse10) (and .cse0 .cse1 .cse4 (not .cse6) .cse12) (and .cse0 .cse6 .cse1 .cse10) (and .cse11 (= ~a10~0 1) .cse1 .cse2 (not (= 1 ~a7~0)) .cse12) (and .cse11 .cse5 .cse1 .cse8 .cse3) (and .cse0 .cse6 .cse1 .cse8) (and .cse7 .cse1 .cse9) (and .cse1 .cse6 .cse8 .cse3) (and .cse6 .cse1 .cse2) (and .cse1 .cse2 .cse10)))) [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:56:17,078 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1536) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,079 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-23 20:56:17,080 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse4 (= ~a12~0 1))) (let ((.cse12 (= ~a16~0 1)) (.cse11 (not (= 0 ~a3~0))) (.cse5 (<= ~a6~0 0)) (.cse0 (<= ~a3~0 0)) (.cse7 (= 1 ~a3~0)) (.cse9 (<= ~a20~0 0)) (.cse8 (not .cse4)) (.cse3 (= ~a11~0 1)) (.cse6 (= ~a27~0 1)) (.cse1 (= 1 ~a5~0)) (.cse2 (= 1 ~a6~0)) (.cse10 (= ~a26~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse6 .cse1 .cse4) (and .cse7 .cse1 .cse4) (and .cse6 .cse1 .cse8 .cse9) (and .cse7 .cse1 .cse10) (and .cse0 .cse5 .cse1 .cse4) (and .cse11 .cse1 .cse2 .cse8) (and .cse5 .cse1 .cse3 .cse10 .cse12 (<= ~a27~0 0)) (and .cse11 .cse1 .cse4 .cse10) (and .cse0 .cse1 .cse4 (not .cse6) .cse12) (and .cse0 .cse6 .cse1 .cse10) (and .cse11 (= ~a10~0 1) .cse1 .cse2 (not (= 1 ~a7~0)) .cse12) (and .cse11 .cse5 .cse1 .cse8 .cse3) (and .cse0 .cse6 .cse1 .cse8) (and .cse7 .cse1 .cse9) (and .cse1 .cse6 .cse8 .cse3) (and .cse6 .cse1 .cse2) (and .cse1 .cse2 .cse10)))) [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-23 20:56:17,081 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:56:17,082 INFO L444 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,083 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,084 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-23 20:56:17,085 INFO L444 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,086 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,087 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-23 20:56:17,088 INFO L444 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,089 INFO L444 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,090 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-23 20:56:17,091 INFO L444 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,092 INFO L444 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-23 20:56:17,093 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,094 INFO L444 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-23 20:56:17,094 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-23 20:56:17,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:56:17 BoogieIcfgContainer [2019-11-23 20:56:17,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:56:17,124 INFO L168 Benchmark]: Toolchain (without parser) took 57230.50 ms. Allocated memory was 144.7 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 97.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,125 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1339.44 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 97.3 MB in the beginning and 123.0 MB in the end (delta: -25.7 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.85 ms. Allocated memory is still 204.5 MB. Free memory was 123.0 MB in the beginning and 108.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,127 INFO L168 Benchmark]: Boogie Preprocessor took 112.62 ms. Allocated memory is still 204.5 MB. Free memory was 108.1 MB in the beginning and 97.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,128 INFO L168 Benchmark]: RCFGBuilder took 2184.55 ms. Allocated memory was 204.5 MB in the beginning and 261.6 MB in the end (delta: 57.1 MB). Free memory was 97.2 MB in the beginning and 90.1 MB in the end (delta: 7.2 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,129 INFO L168 Benchmark]: TraceAbstraction took 53425.92 ms. Allocated memory was 261.6 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 90.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-11-23 20:56:17,133 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1339.44 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 97.3 MB in the beginning and 123.0 MB in the end (delta: -25.7 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 162.85 ms. Allocated memory is still 204.5 MB. Free memory was 123.0 MB in the beginning and 108.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.62 ms. Allocated memory is still 204.5 MB. Free memory was 108.1 MB in the beginning and 97.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2184.55 ms. Allocated memory was 204.5 MB in the beginning and 261.6 MB in the end (delta: 57.1 MB). Free memory was 97.2 MB in the beginning and 90.1 MB in the end (delta: 7.2 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53425.92 ms. Allocated memory was 261.6 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 90.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1536]: 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: ((((((((((((((((((((a3 <= 0 && 1 == a5) && 1 == a6) && a11 == 1) || (((a3 <= 0 && 1 == a5) && 1 == a6) && a12 == 1)) || (((a6 <= 0 && a27 == 1) && 1 == a5) && a12 == 1)) || ((1 == a3 && 1 == a5) && a12 == 1)) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && a20 <= 0)) || ((1 == a3 && 1 == a5) && a26 == 1)) || (((a3 <= 0 && a6 <= 0) && 1 == a5) && a12 == 1)) || (((!(0 == a3) && 1 == a5) && 1 == a6) && !(a12 == 1))) || (((((a6 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || (((!(0 == a3) && 1 == a5) && a12 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && a16 == 1)) || (((a3 <= 0 && a27 == 1) && 1 == a5) && a26 == 1)) || (((((!(0 == a3) && a10 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1)) || ((((!(0 == a3) && a6 <= 0) && 1 == a5) && !(a12 == 1)) && a11 == 1)) || (((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1))) || ((1 == a3 && 1 == a5) && a20 <= 0)) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 == 1)) || ((a27 == 1 && 1 == a5) && 1 == a6)) || ((1 == a5 && 1 == a6) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a3 <= 0 && 1 == a5) && 1 == a6) && a11 == 1) || (((a3 <= 0 && 1 == a5) && 1 == a6) && a12 == 1)) || (((a6 <= 0 && a27 == 1) && 1 == a5) && a12 == 1)) || ((1 == a3 && 1 == a5) && a12 == 1)) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && a20 <= 0)) || ((1 == a3 && 1 == a5) && a26 == 1)) || (((a3 <= 0 && a6 <= 0) && 1 == a5) && a12 == 1)) || (((!(0 == a3) && 1 == a5) && 1 == a6) && !(a12 == 1))) || (((((a6 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || (((!(0 == a3) && 1 == a5) && a12 == 1) && a26 == 1)) || ((((a3 <= 0 && 1 == a5) && a12 == 1) && !(a27 == 1)) && a16 == 1)) || (((a3 <= 0 && a27 == 1) && 1 == a5) && a26 == 1)) || (((((!(0 == a3) && a10 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1)) || ((((!(0 == a3) && a6 <= 0) && 1 == a5) && !(a12 == 1)) && a11 == 1)) || (((a3 <= 0 && a27 == 1) && 1 == a5) && !(a12 == 1))) || ((1 == a3 && 1 == a5) && a20 <= 0)) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && a11 == 1)) || ((a27 == 1 && 1 == a5) && 1 == a6)) || ((1 == a5 && 1 == a6) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 53.3s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.4s, HoareTripleCheckerStatistics: 2801 SDtfs, 5380 SDslu, 1082 SDs, 0 SdLazy, 10426 SolverSat, 2019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 564 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135582occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 13986 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1693 NumberOfFragments, 525 HoareAnnotationTreeSize, 3 FomulaSimplifications, 57150 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 23528 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4092 NumberOfCodeBlocks, 4092 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4075 ConstructedInterpolants, 0 QuantifiedInterpolants, 1648466 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1076 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 1936/1947 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...