/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:53:04,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:53:04,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:53:04,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:53:04,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:53:04,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:53:04,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:53:04,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:53:04,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:53:04,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:53:04,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:53:04,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:53:04,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:53:04,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:53:04,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:53:04,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:53:04,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:53:04,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:53:04,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:53:04,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:53:04,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:53:04,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:53:04,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:53:04,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:53:04,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:53:04,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:53:04,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:53:04,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:53:04,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:53:04,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:53:04,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:53:04,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:53:04,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:53:04,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:53:04,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:53:04,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:53:04,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:53:04,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:53:04,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:53:04,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:53:04,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:53:04,771 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:53:04,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:53:04,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:53:04,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:53:04,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:53:04,792 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:53:04,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:53:04,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:53:04,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:53:04,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:53:04,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:53:04,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:53:04,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:53:04,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:53:04,795 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:53:04,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:53:04,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:53:04,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:53:04,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:53:04,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:53:04,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:53:04,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:53:04,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:53:04,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:53:04,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:53:04,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:53:04,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:53:04,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:53:04,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:53:04,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:53:04,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:53:05,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:53:05,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:53:05,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:53:05,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:53:05,098 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:53:05,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51.c [2019-11-23 20:53:05,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567018a56/47da76b1ac914aa4b39d3d09d7d11dd0/FLAGba4c35fc4 [2019-11-23 20:53:05,699 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:53:05,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label51.c [2019-11-23 20:53:05,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567018a56/47da76b1ac914aa4b39d3d09d7d11dd0/FLAGba4c35fc4 [2019-11-23 20:53:06,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567018a56/47da76b1ac914aa4b39d3d09d7d11dd0 [2019-11-23 20:53:06,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:53:06,012 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:53:06,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:06,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:53:06,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:53:06,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06, skipping insertion in model container [2019-11-23 20:53:06,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:53:06,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:53:06,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:06,597 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:53:06,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:06,704 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:53:06,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06 WrapperNode [2019-11-23 20:53:06,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:06,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:06,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:53:06,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:53:06,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:06,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:53:06,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:53:06,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:53:06,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... [2019-11-23 20:53:06,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:53:06,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:53:06,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:53:06,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:53:06,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:53:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:53:06,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:53:08,433 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:53:08,433 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:53:08,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:08 BoogieIcfgContainer [2019-11-23 20:53:08,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:53:08,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:53:08,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:53:08,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:53:08,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:06" (1/3) ... [2019-11-23 20:53:08,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5237a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:08, skipping insertion in model container [2019-11-23 20:53:08,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:06" (2/3) ... [2019-11-23 20:53:08,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5237a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:08, skipping insertion in model container [2019-11-23 20:53:08,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:08" (3/3) ... [2019-11-23 20:53:08,447 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label51.c [2019-11-23 20:53:08,457 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:53:08,467 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:53:08,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:53:08,513 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:53:08,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:53:08,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:53:08,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:53:08,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:53:08,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:53:08,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:53:08,515 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:53:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:53:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-23 20:53:08,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:08,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:08,551 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1145971337, now seen corresponding path program 1 times [2019-11-23 20:53:08,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:08,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730122550] [2019-11-23 20:53:08,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:08,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730122550] [2019-11-23 20:53:08,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:08,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:53:08,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143018328] [2019-11-23 20:53:08,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:08,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:09,009 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-23 20:53:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:09,980 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-23 20:53:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:09,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-23 20:53:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:10,010 INFO L225 Difference]: With dead ends: 528 [2019-11-23 20:53:10,010 INFO L226 Difference]: Without dead ends: 266 [2019-11-23 20:53:10,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-23 20:53:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-23 20:53:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:53:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-23 20:53:10,116 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 106 [2019-11-23 20:53:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:10,117 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-23 20:53:10,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-23 20:53:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 20:53:10,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:10,125 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:10,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash 366337359, now seen corresponding path program 1 times [2019-11-23 20:53:10,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:10,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232297252] [2019-11-23 20:53:10,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:10,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232297252] [2019-11-23 20:53:10,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:10,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:10,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94207077] [2019-11-23 20:53:10,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:10,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:10,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:10,210 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-23 20:53:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:10,829 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-23 20:53:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:10,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 20:53:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:10,832 INFO L225 Difference]: With dead ends: 792 [2019-11-23 20:53:10,833 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 20:53:10,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 20:53:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 20:53:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 20:53:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2019-11-23 20:53:10,850 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 111 [2019-11-23 20:53:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:10,851 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2019-11-23 20:53:10,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2019-11-23 20:53:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-23 20:53:10,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:10,854 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:10,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash -206300869, now seen corresponding path program 1 times [2019-11-23 20:53:10,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:10,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876749331] [2019-11-23 20:53:10,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:10,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876749331] [2019-11-23 20:53:10,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:10,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:53:10,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488847647] [2019-11-23 20:53:10,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:10,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:10,967 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2019-11-23 20:53:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:11,518 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2019-11-23 20:53:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:11,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-23 20:53:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:11,522 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:53:11,523 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 20:53:11,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 20:53:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2019-11-23 20:53:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 20:53:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2019-11-23 20:53:11,540 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 119 [2019-11-23 20:53:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:11,540 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2019-11-23 20:53:11,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2019-11-23 20:53:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-23 20:53:11,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:11,543 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:11,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash -118652371, now seen corresponding path program 1 times [2019-11-23 20:53:11,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:11,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245011388] [2019-11-23 20:53:11,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:11,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245011388] [2019-11-23 20:53:11,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:11,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:11,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356658864] [2019-11-23 20:53:11,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:11,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:11,610 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2019-11-23 20:53:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:12,522 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2019-11-23 20:53:12,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:12,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-23 20:53:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:12,531 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:53:12,531 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:53:12,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:53:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-23 20:53:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-23 20:53:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2019-11-23 20:53:12,603 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 128 [2019-11-23 20:53:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:12,603 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2019-11-23 20:53:12,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2019-11-23 20:53:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-23 20:53:12,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:12,608 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:12,608 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1007946460, now seen corresponding path program 1 times [2019-11-23 20:53:12,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:12,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88009314] [2019-11-23 20:53:12,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:12,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88009314] [2019-11-23 20:53:12,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:12,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:12,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394765018] [2019-11-23 20:53:12,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:12,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:12,774 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2019-11-23 20:53:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:13,509 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2019-11-23 20:53:13,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:13,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-23 20:53:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:13,521 INFO L225 Difference]: With dead ends: 2762 [2019-11-23 20:53:13,521 INFO L226 Difference]: Without dead ends: 1450 [2019-11-23 20:53:13,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:53:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-23 20:53:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-23 20:53:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:53:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2019-11-23 20:53:13,571 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 134 [2019-11-23 20:53:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:13,572 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2019-11-23 20:53:13,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2019-11-23 20:53:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-23 20:53:13,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:13,579 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:13,579 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1361139476, now seen corresponding path program 1 times [2019-11-23 20:53:13,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:13,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854701846] [2019-11-23 20:53:13,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:13,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854701846] [2019-11-23 20:53:13,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:13,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:13,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37835967] [2019-11-23 20:53:13,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:53:13,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:53:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:53:13,705 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2019-11-23 20:53:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:14,640 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2019-11-23 20:53:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:14,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-23 20:53:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:14,650 INFO L225 Difference]: With dead ends: 2888 [2019-11-23 20:53:14,650 INFO L226 Difference]: Without dead ends: 1576 [2019-11-23 20:53:14,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:53:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-23 20:53:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-23 20:53:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:53:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2019-11-23 20:53:14,684 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 138 [2019-11-23 20:53:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:14,684 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2019-11-23 20:53:14,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:53:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2019-11-23 20:53:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 20:53:14,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:14,687 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:14,688 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -892874449, now seen corresponding path program 1 times [2019-11-23 20:53:14,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:14,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366900428] [2019-11-23 20:53:14,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-23 20:53:14,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366900428] [2019-11-23 20:53:14,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:14,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:14,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673164902] [2019-11-23 20:53:14,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:14,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:14,787 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2019-11-23 20:53:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:15,296 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2019-11-23 20:53:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:15,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-23 20:53:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:15,305 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:53:15,305 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:53:15,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:53:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-23 20:53:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:53:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2019-11-23 20:53:15,342 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 141 [2019-11-23 20:53:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2019-11-23 20:53:15,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2019-11-23 20:53:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-23 20:53:15,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:15,346 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:15,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:15,347 INFO L82 PathProgramCache]: Analyzing trace with hash 468657843, now seen corresponding path program 1 times [2019-11-23 20:53:15,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:15,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295972002] [2019-11-23 20:53:15,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:53:15,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295972002] [2019-11-23 20:53:15,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:15,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:15,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208274546] [2019-11-23 20:53:15,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:53:15,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:53:15,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:53:15,446 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2019-11-23 20:53:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:16,473 INFO L93 Difference]: Finished difference Result 4593 states and 5243 transitions. [2019-11-23 20:53:16,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:16,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-23 20:53:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:16,487 INFO L225 Difference]: With dead ends: 4593 [2019-11-23 20:53:16,488 INFO L226 Difference]: Without dead ends: 3019 [2019-11-23 20:53:16,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:53:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2019-11-23 20:53:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 2493. [2019-11-23 20:53:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-23 20:53:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2762 transitions. [2019-11-23 20:53:16,544 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2762 transitions. Word has length 156 [2019-11-23 20:53:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:16,545 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2762 transitions. [2019-11-23 20:53:16,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:53:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2762 transitions. [2019-11-23 20:53:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 20:53:16,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:16,550 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:16,550 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash -779622233, now seen corresponding path program 1 times [2019-11-23 20:53:16,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:16,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915369539] [2019-11-23 20:53:16,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 20:53:16,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915369539] [2019-11-23 20:53:16,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:16,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:53:16,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124470784] [2019-11-23 20:53:16,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:53:16,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:16,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:53:16,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:16,686 INFO L87 Difference]: Start difference. First operand 2493 states and 2762 transitions. Second operand 4 states. [2019-11-23 20:53:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:17,520 INFO L93 Difference]: Finished difference Result 5508 states and 6131 transitions. [2019-11-23 20:53:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:53:17,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-23 20:53:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:17,530 INFO L225 Difference]: With dead ends: 5508 [2019-11-23 20:53:17,530 INFO L226 Difference]: Without dead ends: 2886 [2019-11-23 20:53:17,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:53:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-11-23 20:53:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2493. [2019-11-23 20:53:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-23 20:53:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2683 transitions. [2019-11-23 20:53:17,584 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2683 transitions. Word has length 185 [2019-11-23 20:53:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:17,585 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2683 transitions. [2019-11-23 20:53:17,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:53:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2683 transitions. [2019-11-23 20:53:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-11-23 20:53:17,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:17,592 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:17,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1645730410, now seen corresponding path program 1 times [2019-11-23 20:53:17,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:17,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841711088] [2019-11-23 20:53:17,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-23 20:53:17,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841711088] [2019-11-23 20:53:17,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:17,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:53:17,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740970435] [2019-11-23 20:53:17,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:53:17,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:53:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:53:17,828 INFO L87 Difference]: Start difference. First operand 2493 states and 2683 transitions. Second operand 6 states. [2019-11-23 20:53:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:18,627 INFO L93 Difference]: Finished difference Result 5162 states and 5545 transitions. [2019-11-23 20:53:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:53:18,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2019-11-23 20:53:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:18,635 INFO L225 Difference]: With dead ends: 5162 [2019-11-23 20:53:18,635 INFO L226 Difference]: Without dead ends: 2671 [2019-11-23 20:53:18,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:53:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-11-23 20:53:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2362. [2019-11-23 20:53:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-11-23 20:53:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2529 transitions. [2019-11-23 20:53:18,678 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2529 transitions. Word has length 276 [2019-11-23 20:53:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:18,678 INFO L462 AbstractCegarLoop]: Abstraction has 2362 states and 2529 transitions. [2019-11-23 20:53:18,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:53:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2529 transitions. [2019-11-23 20:53:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-23 20:53:18,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:18,685 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:53:18,686 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash -731842585, now seen corresponding path program 1 times [2019-11-23 20:53:18,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:18,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266970589] [2019-11-23 20:53:18,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:53:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:53:18,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266970589] [2019-11-23 20:53:18,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:53:18,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:53:18,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236608619] [2019-11-23 20:53:18,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:53:18,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:53:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:53:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:18,818 INFO L87 Difference]: Start difference. First operand 2362 states and 2529 transitions. Second operand 3 states. [2019-11-23 20:53:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:53:19,303 INFO L93 Difference]: Finished difference Result 4982 states and 5344 transitions. [2019-11-23 20:53:19,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:53:19,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-23 20:53:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:53:19,304 INFO L225 Difference]: With dead ends: 4982 [2019-11-23 20:53:19,304 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:53:19,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:53:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:53:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:53:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:53:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:53:19,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2019-11-23 20:53:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:53:19,313 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:53:19,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:53:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:53:19,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:53:19,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:53:19,661 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-23 20:53:19,896 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:53:19,900 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:53:19,901 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,902 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:53:19,903 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:53:19,903 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:53:19,903 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:53:19,903 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:53:19,904 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,905 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:53:19,906 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:53:19,906 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:53:19,906 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:53:19,906 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:53:19,906 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:53:19,907 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:53:19,907 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:53:19,907 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:53:19,908 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:53:19,909 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:53:19,910 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:53:19,911 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:53:19,912 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:53:19,912 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:53:19,912 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:53:19,912 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:53:19,912 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,912 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:53:19,913 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:53:19,914 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:53:19,915 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,915 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= ~a17~0 1))) (let ((.cse4 (= ~a16~0 6)) (.cse6 (not (= ~a20~0 1))) (.cse0 (= ~a16~0 4)) (.cse3 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= 15 ~a8~0)) (.cse7 (= ~a16~0 5))) (or (and .cse0 .cse1) (= 1 ~a7~0) (and .cse2 .cse3 .cse4) (and .cse5 (= ~a21~0 1)) (and .cse6 .cse7) (and .cse6 .cse2 .cse4) (and .cse6 .cse0 .cse3) (and .cse1 .cse2 .cse7)))) [2019-11-23 20:53:19,915 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,915 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,915 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,915 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,916 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:53:19,917 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:53:19,918 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:53:19,919 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:53:19,920 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:53:19,921 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:53:19,922 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:53:19,922 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:53:19,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:53:19 BoogieIcfgContainer [2019-11-23 20:53:19,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:53:19,946 INFO L168 Benchmark]: Toolchain (without parser) took 13933.12 ms. Allocated memory was 144.2 MB in the beginning and 443.5 MB in the end (delta: 299.4 MB). Free memory was 100.6 MB in the beginning and 368.6 MB in the end (delta: -268.0 MB). Peak memory consumption was 319.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,947 INFO L168 Benchmark]: CDTParser took 0.22 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.12 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 100.4 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.92 ms. Allocated memory is still 203.4 MB. Free memory was 169.3 MB in the beginning and 163.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,949 INFO L168 Benchmark]: Boogie Preprocessor took 106.74 ms. Allocated memory is still 203.4 MB. Free memory was 162.9 MB in the beginning and 158.6 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,950 INFO L168 Benchmark]: RCFGBuilder took 1509.86 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 158.6 MB in the beginning and 170.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,951 INFO L168 Benchmark]: TraceAbstraction took 11506.97 ms. Allocated memory was 234.4 MB in the beginning and 443.5 MB in the end (delta: 209.2 MB). Free memory was 170.4 MB in the beginning and 368.6 MB in the end (delta: -198.2 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:53:19,956 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.22 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.12 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 100.4 MB in the beginning and 169.3 MB in the end (delta: -68.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.92 ms. Allocated memory is still 203.4 MB. Free memory was 169.3 MB in the beginning and 163.6 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.74 ms. Allocated memory is still 203.4 MB. Free memory was 162.9 MB in the beginning and 158.6 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1509.86 ms. Allocated memory was 203.4 MB in the beginning and 234.4 MB in the end (delta: 30.9 MB). Free memory was 158.6 MB in the beginning and 170.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11506.97 ms. Allocated memory was 234.4 MB in the beginning and 443.5 MB in the end (delta: 209.2 MB). Free memory was 170.4 MB in the beginning and 368.6 MB in the end (delta: -198.2 MB). Peak memory consumption was 298.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((a16 == 4 && a17 <= 0) || 1 == a7) || ((15 == a8 && !(a17 == 1)) && a16 == 6)) || (a17 == 1 && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 1027 SDtfs, 2372 SDslu, 126 SDs, 0 SdLazy, 5885 SolverSat, 828 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1757 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 141 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5203 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 208 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 611684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1139/1139 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...