/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/Problem14_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:12:46,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:12:46,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:12:46,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:12:46,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:12:46,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:12:46,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:12:46,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:12:46,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:12:46,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:12:46,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:12:46,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:12:46,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:12:46,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:12:46,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:12:46,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:12:46,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:12:46,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:12:46,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:12:46,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:12:46,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:12:46,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:12:46,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:12:46,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:12:46,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:12:46,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:12:46,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:12:46,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:12:46,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:12:46,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:12:46,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:12:46,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:12:46,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:12:46,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:12:46,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:12:46,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:12:46,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:12:46,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:12:46,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:12:46,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:12:46,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:12:46,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:12:46,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:12:46,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:12:46,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:12:46,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:12:46,643 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:12:46,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:12:46,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:12:46,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:12:46,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:12:46,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:12:46,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:12:46,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:12:46,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:12:46,645 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:12:46,645 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:12:46,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:12:46,646 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:12:46,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:12:46,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:12:46,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:12:46,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:12:46,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:12:46,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:12:46,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:12:46,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:12:46,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:12:46,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:12:46,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:12:46,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:12:46,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:12:46,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:12:46,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:12:46,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:12:46,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:12:46,974 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:12:46,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-11-23 21:12:47,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368790a4b/ef0dd427bdb74e20ae09ce56cfca623c/FLAG70722a682 [2019-11-23 21:12:47,598 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:12:47,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-11-23 21:12:47,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368790a4b/ef0dd427bdb74e20ae09ce56cfca623c/FLAG70722a682 [2019-11-23 21:12:47,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368790a4b/ef0dd427bdb74e20ae09ce56cfca623c [2019-11-23 21:12:47,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:12:47,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:12:47,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:12:47,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:12:47,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:12:47,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:12:47" (1/1) ... [2019-11-23 21:12:47,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a06d2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:47, skipping insertion in model container [2019-11-23 21:12:47,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:12:47" (1/1) ... [2019-11-23 21:12:47,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:12:47,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:12:48,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:12:48,490 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:12:48,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:12:48,692 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:12:48,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48 WrapperNode [2019-11-23 21:12:48,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:12:48,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:12:48,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:12:48,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:12:48,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:12:48,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:12:48,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:12:48,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:12:48,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... [2019-11-23 21:12:48,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:12:48,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:12:48,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:12:48,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:12:48,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:12:49,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:12:49,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:12:50,609 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:12:50,609 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:12:50,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:12:50 BoogieIcfgContainer [2019-11-23 21:12:50,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:12:50,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:12:50,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:12:50,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:12:50,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:12:47" (1/3) ... [2019-11-23 21:12:50,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d06e696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:12:50, skipping insertion in model container [2019-11-23 21:12:50,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:12:48" (2/3) ... [2019-11-23 21:12:50,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d06e696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:12:50, skipping insertion in model container [2019-11-23 21:12:50,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:12:50" (3/3) ... [2019-11-23 21:12:50,621 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2019-11-23 21:12:50,629 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:12:50,636 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:12:50,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:12:50,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:12:50,677 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:12:50,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:12:50,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:12:50,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:12:50,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:12:50,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:12:50,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:12:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-23 21:12:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:12:50,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:50,716 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] [2019-11-23 21:12:50,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:50,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:50,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-11-23 21:12:50,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:50,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777720209] [2019-11-23 21:12:50,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:12:51,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777720209] [2019-11-23 21:12:51,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:51,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:12:51,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139685063] [2019-11-23 21:12:51,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:51,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:51,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:51,074 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-23 21:12:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:53,030 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-23 21:12:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:53,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-23 21:12:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:53,050 INFO L225 Difference]: With dead ends: 866 [2019-11-23 21:12:53,050 INFO L226 Difference]: Without dead ends: 538 [2019-11-23 21:12:53,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-23 21:12:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 360. [2019-11-23 21:12:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-23 21:12:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2019-11-23 21:12:53,136 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 36 [2019-11-23 21:12:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:53,136 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2019-11-23 21:12:53,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2019-11-23 21:12:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 21:12:53,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:53,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:12:53,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash 598559029, now seen corresponding path program 1 times [2019-11-23 21:12:53,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:53,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726331206] [2019-11-23 21:12:53,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:12:53,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726331206] [2019-11-23 21:12:53,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:53,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:53,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820070514] [2019-11-23 21:12:53,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:53,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:53,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:53,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:53,332 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2019-11-23 21:12:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:54,930 INFO L93 Difference]: Finished difference Result 1430 states and 2032 transitions. [2019-11-23 21:12:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:54,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-23 21:12:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:54,941 INFO L225 Difference]: With dead ends: 1430 [2019-11-23 21:12:54,941 INFO L226 Difference]: Without dead ends: 716 [2019-11-23 21:12:54,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-23 21:12:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 538. [2019-11-23 21:12:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-23 21:12:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 787 transitions. [2019-11-23 21:12:54,990 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 787 transitions. Word has length 115 [2019-11-23 21:12:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:54,990 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 787 transitions. [2019-11-23 21:12:54,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 787 transitions. [2019-11-23 21:12:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-23 21:12:55,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:55,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:12:55,000 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:55,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash -597275881, now seen corresponding path program 1 times [2019-11-23 21:12:55,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:55,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645267786] [2019-11-23 21:12:55,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:12:55,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645267786] [2019-11-23 21:12:55,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:55,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:12:55,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005084383] [2019-11-23 21:12:55,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:12:55,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:55,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:12:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:55,134 INFO L87 Difference]: Start difference. First operand 538 states and 787 transitions. Second operand 4 states. [2019-11-23 21:12:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:56,666 INFO L93 Difference]: Finished difference Result 2142 states and 3140 transitions. [2019-11-23 21:12:56,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:12:56,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-23 21:12:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:56,683 INFO L225 Difference]: With dead ends: 2142 [2019-11-23 21:12:56,683 INFO L226 Difference]: Without dead ends: 1606 [2019-11-23 21:12:56,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:12:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-23 21:12:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1250. [2019-11-23 21:12:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-23 21:12:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1690 transitions. [2019-11-23 21:12:56,735 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1690 transitions. Word has length 127 [2019-11-23 21:12:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:56,736 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1690 transitions. [2019-11-23 21:12:56,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:12:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1690 transitions. [2019-11-23 21:12:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-23 21:12:56,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:56,759 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 21:12:56,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1779789830, now seen corresponding path program 1 times [2019-11-23 21:12:56,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:56,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385686615] [2019-11-23 21:12:56,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 21:12:57,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385686615] [2019-11-23 21:12:57,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:12:57,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:12:57,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462240597] [2019-11-23 21:12:57,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:12:57,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:57,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:12:57,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:12:57,334 INFO L87 Difference]: Start difference. First operand 1250 states and 1690 transitions. Second operand 6 states. [2019-11-23 21:12:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:12:58,607 INFO L93 Difference]: Finished difference Result 2340 states and 3185 transitions. [2019-11-23 21:12:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:12:58,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-11-23 21:12:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:12:58,615 INFO L225 Difference]: With dead ends: 2340 [2019-11-23 21:12:58,615 INFO L226 Difference]: Without dead ends: 1270 [2019-11-23 21:12:58,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:12:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-23 21:12:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1250. [2019-11-23 21:12:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-23 21:12:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1661 transitions. [2019-11-23 21:12:58,652 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1661 transitions. Word has length 242 [2019-11-23 21:12:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:12:58,653 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1661 transitions. [2019-11-23 21:12:58,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:12:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1661 transitions. [2019-11-23 21:12:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-11-23 21:12:58,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:12:58,659 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:12:58,659 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:12:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:12:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1462057874, now seen corresponding path program 1 times [2019-11-23 21:12:58,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:12:58,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763043189] [2019-11-23 21:12:58,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:12:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-23 21:12:58,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763043189] [2019-11-23 21:12:58,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374913269] [2019-11-23 21:12:58,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:12:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:12:59,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:12:59,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:12:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-23 21:12:59,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:12:59,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 21:12:59,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114099639] [2019-11-23 21:12:59,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:12:59,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:12:59,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:12:59,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:12:59,347 INFO L87 Difference]: Start difference. First operand 1250 states and 1661 transitions. Second operand 3 states. [2019-11-23 21:13:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:00,280 INFO L93 Difference]: Finished difference Result 3032 states and 4129 transitions. [2019-11-23 21:13:00,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:00,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-11-23 21:13:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:00,295 INFO L225 Difference]: With dead ends: 3032 [2019-11-23 21:13:00,295 INFO L226 Difference]: Without dead ends: 1962 [2019-11-23 21:13:00,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-23 21:13:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1250. [2019-11-23 21:13:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-23 21:13:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1547 transitions. [2019-11-23 21:13:00,353 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1547 transitions. Word has length 322 [2019-11-23 21:13:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:00,354 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1547 transitions. [2019-11-23 21:13:00,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1547 transitions. [2019-11-23 21:13:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-23 21:13:00,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:00,394 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:00,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:00,601 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1521243895, now seen corresponding path program 1 times [2019-11-23 21:13:00,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:00,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338701461] [2019-11-23 21:13:00,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-23 21:13:00,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338701461] [2019-11-23 21:13:00,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371895650] [2019-11-23 21:13:00,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:01,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:13:01,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-23 21:13:01,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-23 21:13:01,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219501562] [2019-11-23 21:13:01,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:01,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:01,254 INFO L87 Difference]: Start difference. First operand 1250 states and 1547 transitions. Second operand 4 states. [2019-11-23 21:13:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:02,143 INFO L93 Difference]: Finished difference Result 2527 states and 3120 transitions. [2019-11-23 21:13:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:02,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-11-23 21:13:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:02,152 INFO L225 Difference]: With dead ends: 2527 [2019-11-23 21:13:02,153 INFO L226 Difference]: Without dead ends: 1428 [2019-11-23 21:13:02,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:13:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-23 21:13:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1250. [2019-11-23 21:13:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-11-23 21:13:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1394 transitions. [2019-11-23 21:13:02,191 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1394 transitions. Word has length 339 [2019-11-23 21:13:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:02,191 INFO L462 AbstractCegarLoop]: Abstraction has 1250 states and 1394 transitions. [2019-11-23 21:13:02,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1394 transitions. [2019-11-23 21:13:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-11-23 21:13:02,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:02,200 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:02,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:02,401 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:02,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1098217332, now seen corresponding path program 1 times [2019-11-23 21:13:02,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:02,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918741268] [2019-11-23 21:13:02,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 180 proven. 130 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 21:13:03,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918741268] [2019-11-23 21:13:03,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220326594] [2019-11-23 21:13:03,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:03,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:13:03,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-23 21:13:03,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:13:03,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-23 21:13:03,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716134308] [2019-11-23 21:13:03,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:03,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:03,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:03,420 INFO L87 Difference]: Start difference. First operand 1250 states and 1394 transitions. Second operand 3 states. [2019-11-23 21:13:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:03,998 INFO L93 Difference]: Finished difference Result 3032 states and 3452 transitions. [2019-11-23 21:13:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:03,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-11-23 21:13:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:04,007 INFO L225 Difference]: With dead ends: 3032 [2019-11-23 21:13:04,007 INFO L226 Difference]: Without dead ends: 1962 [2019-11-23 21:13:04,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-23 21:13:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2019-11-23 21:13:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-23 21:13:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2173 transitions. [2019-11-23 21:13:04,045 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2173 transitions. Word has length 362 [2019-11-23 21:13:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:04,046 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2173 transitions. [2019-11-23 21:13:04,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2173 transitions. [2019-11-23 21:13:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-11-23 21:13:04,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:04,053 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:04,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:04,257 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash -600587830, now seen corresponding path program 1 times [2019-11-23 21:13:04,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:04,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71039090] [2019-11-23 21:13:04,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 342 proven. 43 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 21:13:05,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71039090] [2019-11-23 21:13:05,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467109248] [2019-11-23 21:13:05,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:05,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:05,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:05,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:13:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 381 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 21:13:05,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:13:05,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-23 21:13:05,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691946165] [2019-11-23 21:13:05,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:13:05,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:13:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:05,635 INFO L87 Difference]: Start difference. First operand 1962 states and 2173 transitions. Second operand 8 states. [2019-11-23 21:13:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:08,026 INFO L93 Difference]: Finished difference Result 3946 states and 4377 transitions. [2019-11-23 21:13:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:13:08,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 365 [2019-11-23 21:13:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:08,038 INFO L225 Difference]: With dead ends: 3946 [2019-11-23 21:13:08,038 INFO L226 Difference]: Without dead ends: 2164 [2019-11-23 21:13:08,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:13:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-23 21:13:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1962. [2019-11-23 21:13:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-23 21:13:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2149 transitions. [2019-11-23 21:13:08,099 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2149 transitions. Word has length 365 [2019-11-23 21:13:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2149 transitions. [2019-11-23 21:13:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:13:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2149 transitions. [2019-11-23 21:13:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-23 21:13:08,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:08,109 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-23 21:13:08,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:08,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash -842004897, now seen corresponding path program 1 times [2019-11-23 21:13:08,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:08,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191361603] [2019-11-23 21:13:08,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-23 21:13:09,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191361603] [2019-11-23 21:13:09,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:09,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:13:09,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60148867] [2019-11-23 21:13:09,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:13:09,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:13:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:09,448 INFO L87 Difference]: Start difference. First operand 1962 states and 2149 transitions. Second operand 8 states. [2019-11-23 21:13:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:10,842 INFO L93 Difference]: Finished difference Result 3756 states and 4129 transitions. [2019-11-23 21:13:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:13:10,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 537 [2019-11-23 21:13:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:10,851 INFO L225 Difference]: With dead ends: 3756 [2019-11-23 21:13:10,851 INFO L226 Difference]: Without dead ends: 1974 [2019-11-23 21:13:10,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:13:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-23 21:13:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1962. [2019-11-23 21:13:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-23 21:13:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2135 transitions. [2019-11-23 21:13:10,891 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2135 transitions. Word has length 537 [2019-11-23 21:13:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:10,892 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2135 transitions. [2019-11-23 21:13:10,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:13:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2135 transitions. [2019-11-23 21:13:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-11-23 21:13:10,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:10,901 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:10,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:10,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:10,903 INFO L82 PathProgramCache]: Analyzing trace with hash -963993425, now seen corresponding path program 1 times [2019-11-23 21:13:10,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:10,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016993067] [2019-11-23 21:13:10,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-23 21:13:11,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016993067] [2019-11-23 21:13:11,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:11,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:11,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697527635] [2019-11-23 21:13:11,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:11,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:13:11,378 INFO L87 Difference]: Start difference. First operand 1962 states and 2135 transitions. Second operand 3 states. [2019-11-23 21:13:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:12,025 INFO L93 Difference]: Finished difference Result 4456 states and 4878 transitions. [2019-11-23 21:13:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:12,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-11-23 21:13:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:12,037 INFO L225 Difference]: With dead ends: 4456 [2019-11-23 21:13:12,037 INFO L226 Difference]: Without dead ends: 2674 [2019-11-23 21:13:12,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:13:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-23 21:13:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-23 21:13:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:13:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2536 transitions. [2019-11-23 21:13:12,076 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2536 transitions. Word has length 650 [2019-11-23 21:13:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:12,077 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2536 transitions. [2019-11-23 21:13:12,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2536 transitions. [2019-11-23 21:13:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2019-11-23 21:13:12,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:12,084 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:12,084 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2048365184, now seen corresponding path program 1 times [2019-11-23 21:13:12,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:12,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835236599] [2019-11-23 21:13:12,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-23 21:13:12,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835236599] [2019-11-23 21:13:12,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:12,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:12,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260915357] [2019-11-23 21:13:12,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:12,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:13:12,521 INFO L87 Difference]: Start difference. First operand 2318 states and 2536 transitions. Second operand 3 states. [2019-11-23 21:13:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:13,138 INFO L93 Difference]: Finished difference Result 4634 states and 5074 transitions. [2019-11-23 21:13:13,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:13,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 652 [2019-11-23 21:13:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:13,153 INFO L225 Difference]: With dead ends: 4634 [2019-11-23 21:13:13,153 INFO L226 Difference]: Without dead ends: 2318 [2019-11-23 21:13:13,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 21:13:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-23 21:13:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-23 21:13:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-23 21:13:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2494 transitions. [2019-11-23 21:13:13,193 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2494 transitions. Word has length 652 [2019-11-23 21:13:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:13,193 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2494 transitions. [2019-11-23 21:13:13,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2494 transitions. [2019-11-23 21:13:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-11-23 21:13:13,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:13,202 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:13,202 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 689865864, now seen corresponding path program 1 times [2019-11-23 21:13:13,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:13,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614492686] [2019-11-23 21:13:13,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 769 proven. 174 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-23 21:13:15,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614492686] [2019-11-23 21:13:15,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851839036] [2019-11-23 21:13:15,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:15,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:13:15,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:13:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 914 proven. 29 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-23 21:13:16,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:13:16,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-23 21:13:16,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085426789] [2019-11-23 21:13:16,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:13:16,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:13:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:16,096 INFO L87 Difference]: Start difference. First operand 2318 states and 2494 transitions. Second operand 8 states. [2019-11-23 21:13:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:17,579 INFO L93 Difference]: Finished difference Result 4853 states and 5228 transitions. [2019-11-23 21:13:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:13:17,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 695 [2019-11-23 21:13:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:17,592 INFO L225 Difference]: With dead ends: 4853 [2019-11-23 21:13:17,593 INFO L226 Difference]: Without dead ends: 2715 [2019-11-23 21:13:17,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 692 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:13:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2019-11-23 21:13:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2674. [2019-11-23 21:13:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-23 21:13:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2859 transitions. [2019-11-23 21:13:17,652 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2859 transitions. Word has length 695 [2019-11-23 21:13:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:17,653 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2859 transitions. [2019-11-23 21:13:17,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:13:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2859 transitions. [2019-11-23 21:13:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-11-23 21:13:17,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:17,661 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:17,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:13:17,865 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2025724903, now seen corresponding path program 1 times [2019-11-23 21:13:17,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:17,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323113486] [2019-11-23 21:13:17,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1612 backedges. 1000 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-11-23 21:13:18,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323113486] [2019-11-23 21:13:18,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:18,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:13:18,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970752652] [2019-11-23 21:13:18,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:13:18,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:13:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:18,612 INFO L87 Difference]: Start difference. First operand 2674 states and 2859 transitions. Second operand 7 states. [2019-11-23 21:13:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:19,484 INFO L93 Difference]: Finished difference Result 5396 states and 5769 transitions. [2019-11-23 21:13:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:13:19,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 697 [2019-11-23 21:13:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:19,496 INFO L225 Difference]: With dead ends: 5396 [2019-11-23 21:13:19,496 INFO L226 Difference]: Without dead ends: 2852 [2019-11-23 21:13:19,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-23 21:13:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2019-11-23 21:13:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-23 21:13:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2823 transitions. [2019-11-23 21:13:19,549 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2823 transitions. Word has length 697 [2019-11-23 21:13:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:19,550 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2823 transitions. [2019-11-23 21:13:19,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:13:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2823 transitions. [2019-11-23 21:13:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-11-23 21:13:19,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:19,559 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:19,559 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 750664143, now seen corresponding path program 1 times [2019-11-23 21:13:19,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:19,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047801741] [2019-11-23 21:13:19,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-11-23 21:13:20,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047801741] [2019-11-23 21:13:20,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:20,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:13:20,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180692421] [2019-11-23 21:13:20,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:13:20,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:20,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:13:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:13:20,105 INFO L87 Difference]: Start difference. First operand 2674 states and 2823 transitions. Second operand 3 states. [2019-11-23 21:13:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:20,657 INFO L93 Difference]: Finished difference Result 5702 states and 6027 transitions. [2019-11-23 21:13:20,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:13:20,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 722 [2019-11-23 21:13:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:20,669 INFO L225 Difference]: With dead ends: 5702 [2019-11-23 21:13:20,670 INFO L226 Difference]: Without dead ends: 3208 [2019-11-23 21:13:20,673 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 21:13:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-23 21:13:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2019-11-23 21:13:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-23 21:13:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3188 transitions. [2019-11-23 21:13:20,714 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3188 transitions. Word has length 722 [2019-11-23 21:13:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:20,715 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3188 transitions. [2019-11-23 21:13:20,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:13:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3188 transitions. [2019-11-23 21:13:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-11-23 21:13:20,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:20,727 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:20,727 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1954280938, now seen corresponding path program 1 times [2019-11-23 21:13:20,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:20,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974070651] [2019-11-23 21:13:20,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2336 backedges. 1516 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-11-23 21:13:21,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974070651] [2019-11-23 21:13:21,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:21,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:13:21,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580036084] [2019-11-23 21:13:21,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:21,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:21,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:21,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:21,344 INFO L87 Difference]: Start difference. First operand 3030 states and 3188 transitions. Second operand 4 states. [2019-11-23 21:13:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:22,329 INFO L93 Difference]: Finished difference Result 6948 states and 7354 transitions. [2019-11-23 21:13:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:22,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 877 [2019-11-23 21:13:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:22,345 INFO L225 Difference]: With dead ends: 6948 [2019-11-23 21:13:22,346 INFO L226 Difference]: Without dead ends: 3920 [2019-11-23 21:13:22,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-23 21:13:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-23 21:13:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-23 21:13:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3909 transitions. [2019-11-23 21:13:22,415 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3909 transitions. Word has length 877 [2019-11-23 21:13:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:22,416 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3909 transitions. [2019-11-23 21:13:22,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3909 transitions. [2019-11-23 21:13:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2019-11-23 21:13:22,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:22,432 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:22,433 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash 625456656, now seen corresponding path program 1 times [2019-11-23 21:13:22,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:22,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030649080] [2019-11-23 21:13:22,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2909 backedges. 1978 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2019-11-23 21:13:23,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030649080] [2019-11-23 21:13:23,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:23,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:13:23,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30510222] [2019-11-23 21:13:23,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:13:23,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:13:23,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:13:23,892 INFO L87 Difference]: Start difference. First operand 3742 states and 3909 transitions. Second operand 7 states. [2019-11-23 21:13:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:25,304 INFO L93 Difference]: Finished difference Result 7307 states and 7640 transitions. [2019-11-23 21:13:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:13:25,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 970 [2019-11-23 21:13:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:25,312 INFO L225 Difference]: With dead ends: 7307 [2019-11-23 21:13:25,312 INFO L226 Difference]: Without dead ends: 3745 [2019-11-23 21:13:25,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:13:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-23 21:13:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3742. [2019-11-23 21:13:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-23 21:13:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3907 transitions. [2019-11-23 21:13:25,362 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3907 transitions. Word has length 970 [2019-11-23 21:13:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:25,363 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3907 transitions. [2019-11-23 21:13:25,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:13:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3907 transitions. [2019-11-23 21:13:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2019-11-23 21:13:25,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:25,379 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:25,379 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1401544166, now seen corresponding path program 1 times [2019-11-23 21:13:25,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:25,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264374955] [2019-11-23 21:13:25,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 1082 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-23 21:13:26,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264374955] [2019-11-23 21:13:26,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:26,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:13:26,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531556947] [2019-11-23 21:13:26,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:13:26,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:26,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:13:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:26,278 INFO L87 Difference]: Start difference. First operand 3742 states and 3907 transitions. Second operand 4 states. [2019-11-23 21:13:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:27,272 INFO L93 Difference]: Finished difference Result 7838 states and 8187 transitions. [2019-11-23 21:13:27,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:13:27,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1047 [2019-11-23 21:13:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:27,280 INFO L225 Difference]: With dead ends: 7838 [2019-11-23 21:13:27,281 INFO L226 Difference]: Without dead ends: 3920 [2019-11-23 21:13:27,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:13:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-23 21:13:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2019-11-23 21:13:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-23 21:13:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3651 transitions. [2019-11-23 21:13:27,328 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3651 transitions. Word has length 1047 [2019-11-23 21:13:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:27,329 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 3651 transitions. [2019-11-23 21:13:27,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:13:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3651 transitions. [2019-11-23 21:13:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2019-11-23 21:13:27,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:13:27,342 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:13:27,343 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:13:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:13:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1689291374, now seen corresponding path program 1 times [2019-11-23 21:13:27,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:13:27,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106934812] [2019-11-23 21:13:27,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:13:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:13:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3788 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-23 21:13:28,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106934812] [2019-11-23 21:13:28,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:13:28,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:13:28,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109200218] [2019-11-23 21:13:28,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:13:28,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:13:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:13:28,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:13:28,296 INFO L87 Difference]: Start difference. First operand 3564 states and 3651 transitions. Second operand 5 states. [2019-11-23 21:13:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:13:29,485 INFO L93 Difference]: Finished difference Result 7480 states and 7680 transitions. [2019-11-23 21:13:29,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:13:29,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1095 [2019-11-23 21:13:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:13:29,488 INFO L225 Difference]: With dead ends: 7480 [2019-11-23 21:13:29,488 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:13:29,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:13:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:13:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:13:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:13:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:13:29,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1095 [2019-11-23 21:13:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:13:29,495 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:13:29,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:13:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:13:29,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:13:29,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:13:29,744 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 129 [2019-11-23 21:13:30,071 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 131 [2019-11-23 21:13:30,590 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 51 [2019-11-23 21:13:31,153 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 55 [2019-11-23 21:13:31,158 INFO L444 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-23 21:13:31,159 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-23 21:13:31,159 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,159 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,159 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,159 INFO L444 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-23 21:13:31,159 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-23 21:13:31,160 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-23 21:13:31,160 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-23 21:13:31,160 INFO L444 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-23 21:13:31,160 INFO L444 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-23 21:13:31,160 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-23 21:13:31,160 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 21:13:31,161 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,162 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,163 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-23 21:13:31,164 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-23 21:13:31,165 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-23 21:13:31,166 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-23 21:13:31,167 INFO L444 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-23 21:13:31,168 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-23 21:13:31,169 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-23 21:13:31,170 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-23 21:13:31,171 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-23 21:13:31,171 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-23 21:13:31,171 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:13:31,171 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-23 21:13:31,171 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-23 21:13:31,171 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-23 21:13:31,172 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,173 INFO L444 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,174 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-23 21:13:31,175 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-23 21:13:31,176 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-23 21:13:31,177 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,177 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,177 INFO L440 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse3 (< 0 (+ ~a12~0 43))) (.cse5 (= ~a21~0 6)) (.cse2 (<= ~a12~0 11)) (.cse8 (not (= ~a21~0 9))) (.cse0 (= ~a15~0 8)) (.cse1 (= ~a24~0 1)) (.cse6 (not (= ~a15~0 7))) (.cse7 (<= ~a15~0 7)) (.cse4 (not (= ~a21~0 7)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and (not .cse5) .cse6 .cse1 (< 80 ~a12~0)) (and (<= (+ ~a12~0 460225) 0) .cse7 .cse1) (and .cse5 .cse1 (<= ~a12~0 95442)) (and .cse8 .cse1 .cse2 .cse4) (and .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 (<= (+ ~a12~0 49) 0)) (and .cse1 (= ~a21~0 8)) (and .cse7 .cse6) (and .cse7 .cse4))) [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-23 21:13:31,178 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-23 21:13:31,179 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,179 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,179 INFO L447 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-23 21:13:31,179 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-23 21:13:31,179 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-23 21:13:31,179 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-23 21:13:31,179 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-23 21:13:31,180 INFO L444 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,181 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,182 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-23 21:13:31,182 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,182 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-23 21:13:31,182 INFO L440 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse3 (< 0 (+ ~a12~0 43))) (.cse0 (= ~a15~0 8)) (.cse6 (= ~a21~0 6)) (.cse5 (not (= ~a21~0 9))) (.cse2 (<= ~a12~0 11)) (.cse1 (= ~a24~0 1)) (.cse7 (not (= ~a15~0 7))) (.cse8 (<= ~a15~0 7)) (.cse4 (not (= ~a21~0 7)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 (<= (+ ~a12~0 49) 0)) (and (not .cse6) .cse7 .cse1 (< 80 ~a12~0)) (and (<= (+ ~a12~0 460225) 0) .cse8 .cse1) (and .cse6 .cse1 (<= ~a12~0 95442)) (and .cse5 .cse1 .cse2 .cse4) (and .cse1 (= ~a21~0 8)) (and .cse8 .cse7) (and .cse8 .cse4))) [2019-11-23 21:13:31,182 INFO L444 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-23 21:13:31,182 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-23 21:13:31,183 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-23 21:13:31,184 INFO L444 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,185 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-23 21:13:31,186 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 21:13:31,187 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-23 21:13:31,188 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-23 21:13:31,189 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-23 21:13:31,189 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 21:13:31,189 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-23 21:13:31,189 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-23 21:13:31,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:13:31 BoogieIcfgContainer [2019-11-23 21:13:31,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:13:31,228 INFO L168 Benchmark]: Toolchain (without parser) took 43342.26 ms. Allocated memory was 144.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 99.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,229 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.67 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 99.6 MB in the beginning and 161.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.71 ms. Allocated memory is still 203.4 MB. Free memory was 161.0 MB in the beginning and 151.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,230 INFO L168 Benchmark]: Boogie Preprocessor took 119.94 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 145.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,231 INFO L168 Benchmark]: RCFGBuilder took 1661.80 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 145.0 MB in the beginning and 132.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,232 INFO L168 Benchmark]: TraceAbstraction took 40612.17 ms. Allocated memory was 234.9 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 132.5 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-23 21:13:31,235 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.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.67 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 99.6 MB in the beginning and 161.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.71 ms. Allocated memory is still 203.4 MB. Free memory was 161.0 MB in the beginning and 151.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.94 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 145.0 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1661.80 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 145.0 MB in the beginning and 132.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40612.17 ms. Allocated memory was 234.9 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 132.5 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43) || (((a15 == 8 && a24 == 1) && 0 < a12 + 43) && !(a21 == 7))) || (((!(a21 == 9) && a15 == 8) && a24 == 1) && a12 + 49 <= 0)) || (((!(a21 == 6) && !(a15 == 7)) && a24 == 1) && 80 < a12)) || ((a12 + 460225 <= 0 && a15 <= 7) && a24 == 1)) || ((a21 == 6 && a24 == 1) && a12 <= 95442)) || (((!(a21 == 9) && a24 == 1) && a12 <= 11) && !(a21 == 7))) || (a24 == 1 && a21 == 8)) || (a15 <= 7 && !(a15 == 7))) || (a15 <= 7 && !(a21 == 7)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((a15 == 8 && a24 == 1) && a12 <= 11) && 0 < a12 + 43) || (((a15 == 8 && a24 == 1) && 0 < a12 + 43) && !(a21 == 7))) || (((!(a21 == 6) && !(a15 == 7)) && a24 == 1) && 80 < a12)) || ((a12 + 460225 <= 0 && a15 <= 7) && a24 == 1)) || ((a21 == 6 && a24 == 1) && a12 <= 95442)) || (((!(a21 == 9) && a24 == 1) && a12 <= 11) && !(a21 == 7))) || ((((!(a21 == 9) && !(3 == input)) && a15 == 8) && a24 == 1) && a12 + 49 <= 0)) || (a24 == 1 && a21 == 8)) || (a15 <= 7 && !(a15 == 7))) || (a15 <= 7 && !(a21 == 7)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 40.5s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1650 SDtfs, 4712 SDslu, 221 SDs, 0 SdLazy, 15652 SolverSat, 2022 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2180 GetRequests, 2100 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3742occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 3126 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 70 NumberOfFragments, 251 HoareAnnotationTreeSize, 3 FomulaSimplifications, 631764 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 92420 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 11933 NumberOfCodeBlocks, 11933 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 11910 ConstructedInterpolants, 0 QuantifiedInterpolants, 27576344 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2656 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 24980/25368 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...