/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/Problem02_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:54:33,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:54:33,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:54:33,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:54:33,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:54:33,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:54:33,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:54:33,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:54:33,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:54:33,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:54:33,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:54:33,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:54:33,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:54:33,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:54:33,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:54:33,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:54:33,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:54:33,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:54:33,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:54:33,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:54:33,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:54:33,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:54:33,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:54:33,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:54:33,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:54:33,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:54:33,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:54:33,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:54:33,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:54:33,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:54:33,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:54:33,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:54:33,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:54:33,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:54:33,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:54:33,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:54:33,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:54:33,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:54:33,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:54:33,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:54:33,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:54:33,863 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:54:33,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:54:33,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:54:33,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:54:33,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:54:33,901 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:54:33,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:54:33,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:54:33,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:54:33,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:54:33,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:54:33,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:54:33,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:54:33,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:54:33,903 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:54:33,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:54:33,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:54:33,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:54:33,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:54:33,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:54:33,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:54:33,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:54:33,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:54:33,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:54:33,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:54:33,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:54:33,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:54:33,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:54:33,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:54:33,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:54:33,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:54:34,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:54:34,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:54:34,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:54:34,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:54:34,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:54:34,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39.c [2019-11-23 20:54:34,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee8d9059/a063903fa5344f9db948856934a878ed/FLAG524efb6d3 [2019-11-23 20:54:34,882 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:54:34,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39.c [2019-11-23 20:54:34,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee8d9059/a063903fa5344f9db948856934a878ed/FLAG524efb6d3 [2019-11-23 20:54:35,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee8d9059/a063903fa5344f9db948856934a878ed [2019-11-23 20:54:35,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:54:35,208 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:54:35,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:54:35,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:54:35,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:54:35,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:35,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b98ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35, skipping insertion in model container [2019-11-23 20:54:35,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:35,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:54:35,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:54:35,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:54:35,806 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:54:35,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:54:35,941 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:54:35,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35 WrapperNode [2019-11-23 20:54:35,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:54:35,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:54:35,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:54:35,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:54:35,953 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:54:35" (1/1) ... [2019-11-23 20:54:35,974 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:54:35" (1/1) ... [2019-11-23 20:54:36,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:54:36,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:54:36,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:54:36,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:54:36,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (1/1) ... [2019-11-23 20:54:36,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:54:36,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:54:36,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:54:36,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:54:36,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (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:54:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:54:36,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:54:37,439 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:54:37,439 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:54:37,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:54:37 BoogieIcfgContainer [2019-11-23 20:54:37,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:54:37,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:54:37,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:54:37,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:54:37,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:54:35" (1/3) ... [2019-11-23 20:54:37,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb2da72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:54:37, skipping insertion in model container [2019-11-23 20:54:37,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:35" (2/3) ... [2019-11-23 20:54:37,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb2da72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:54:37, skipping insertion in model container [2019-11-23 20:54:37,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:54:37" (3/3) ... [2019-11-23 20:54:37,450 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2019-11-23 20:54:37,461 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:54:37,469 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:54:37,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:54:37,508 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:54:37,508 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:54:37,508 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:54:37,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:54:37,509 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:54:37,509 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:54:37,510 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:54:37,510 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:54:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-23 20:54:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 20:54:37,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:37,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:54:37,545 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1738135197, now seen corresponding path program 1 times [2019-11-23 20:54:37,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:37,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988396734] [2019-11-23 20:54:37,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:38,005 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:54:38,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988396734] [2019-11-23 20:54:38,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:38,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:38,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358002422] [2019-11-23 20:54:38,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:38,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:38,036 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-23 20:54:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:39,541 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-11-23 20:54:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:39,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 20:54:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:39,575 INFO L225 Difference]: With dead ends: 775 [2019-11-23 20:54:39,575 INFO L226 Difference]: Without dead ends: 460 [2019-11-23 20:54:39,581 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:54:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-23 20:54:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-11-23 20:54:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-23 20:54:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-11-23 20:54:39,644 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 111 [2019-11-23 20:54:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:39,645 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-11-23 20:54:39,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-11-23 20:54:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 20:54:39,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:39,649 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:54:39,650 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash -215551336, now seen corresponding path program 1 times [2019-11-23 20:54:39,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:39,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171956398] [2019-11-23 20:54:39,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:39,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171956398] [2019-11-23 20:54:39,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:39,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:39,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917518066] [2019-11-23 20:54:39,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:39,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:39,859 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 4 states. [2019-11-23 20:54:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:40,858 INFO L93 Difference]: Finished difference Result 1180 states and 1741 transitions. [2019-11-23 20:54:40,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:40,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-23 20:54:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:40,864 INFO L225 Difference]: With dead ends: 1180 [2019-11-23 20:54:40,864 INFO L226 Difference]: Without dead ends: 874 [2019-11-23 20:54:40,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-23 20:54:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 870. [2019-11-23 20:54:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-11-23 20:54:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1183 transitions. [2019-11-23 20:54:40,918 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1183 transitions. Word has length 115 [2019-11-23 20:54:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:40,919 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1183 transitions. [2019-11-23 20:54:40,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1183 transitions. [2019-11-23 20:54:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 20:54:40,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:40,932 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:54:40,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1793072302, now seen corresponding path program 1 times [2019-11-23 20:54:40,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:40,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425797103] [2019-11-23 20:54:40,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:54:41,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425797103] [2019-11-23 20:54:41,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:41,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:41,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566018961] [2019-11-23 20:54:41,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:41,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:41,015 INFO L87 Difference]: Start difference. First operand 870 states and 1183 transitions. Second operand 4 states. [2019-11-23 20:54:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:41,641 INFO L93 Difference]: Finished difference Result 2146 states and 2939 transitions. [2019-11-23 20:54:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:41,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-23 20:54:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:41,652 INFO L225 Difference]: With dead ends: 2146 [2019-11-23 20:54:41,652 INFO L226 Difference]: Without dead ends: 1278 [2019-11-23 20:54:41,654 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:54:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-11-23 20:54:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 578. [2019-11-23 20:54:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-23 20:54:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 776 transitions. [2019-11-23 20:54:41,678 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 776 transitions. Word has length 121 [2019-11-23 20:54:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:41,678 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 776 transitions. [2019-11-23 20:54:41,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 776 transitions. [2019-11-23 20:54:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-23 20:54:41,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:41,681 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:54:41,681 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash 63576167, now seen corresponding path program 1 times [2019-11-23 20:54:41,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:41,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402349110] [2019-11-23 20:54:41,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:41,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402349110] [2019-11-23 20:54:41,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:41,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:54:41,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375194169] [2019-11-23 20:54:41,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:41,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:41,725 INFO L87 Difference]: Start difference. First operand 578 states and 776 transitions. Second operand 3 states. [2019-11-23 20:54:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:42,189 INFO L93 Difference]: Finished difference Result 1714 states and 2306 transitions. [2019-11-23 20:54:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:42,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-23 20:54:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:42,195 INFO L225 Difference]: With dead ends: 1714 [2019-11-23 20:54:42,195 INFO L226 Difference]: Without dead ends: 1138 [2019-11-23 20:54:42,197 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:54:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-11-23 20:54:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2019-11-23 20:54:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-11-23 20:54:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1447 transitions. [2019-11-23 20:54:42,225 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1447 transitions. Word has length 121 [2019-11-23 20:54:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:42,225 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 1447 transitions. [2019-11-23 20:54:42,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1447 transitions. [2019-11-23 20:54:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-23 20:54:42,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:42,228 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:42,229 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash 675657489, now seen corresponding path program 1 times [2019-11-23 20:54:42,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:42,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146932095] [2019-11-23 20:54:42,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:42,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146932095] [2019-11-23 20:54:42,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:42,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:42,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78171807] [2019-11-23 20:54:42,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:42,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:42,312 INFO L87 Difference]: Start difference. First operand 1138 states and 1447 transitions. Second operand 4 states. [2019-11-23 20:54:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:43,087 INFO L93 Difference]: Finished difference Result 2415 states and 3064 transitions. [2019-11-23 20:54:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:43,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-23 20:54:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:43,094 INFO L225 Difference]: With dead ends: 2415 [2019-11-23 20:54:43,094 INFO L226 Difference]: Without dead ends: 1279 [2019-11-23 20:54:43,096 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:54:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-11-23 20:54:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-11-23 20:54:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-11-23 20:54:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1438 transitions. [2019-11-23 20:54:43,125 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1438 transitions. Word has length 135 [2019-11-23 20:54:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:43,125 INFO L462 AbstractCegarLoop]: Abstraction has 1279 states and 1438 transitions. [2019-11-23 20:54:43,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1438 transitions. [2019-11-23 20:54:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-23 20:54:43,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:43,129 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:54:43,130 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1227064464, now seen corresponding path program 1 times [2019-11-23 20:54:43,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:43,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244846090] [2019-11-23 20:54:43,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:43,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244846090] [2019-11-23 20:54:43,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:43,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:43,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29982891] [2019-11-23 20:54:43,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:43,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:43,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:43,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:43,190 INFO L87 Difference]: Start difference. First operand 1279 states and 1438 transitions. Second operand 3 states. [2019-11-23 20:54:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:43,712 INFO L93 Difference]: Finished difference Result 3399 states and 3829 transitions. [2019-11-23 20:54:43,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:43,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-23 20:54:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:43,722 INFO L225 Difference]: With dead ends: 3399 [2019-11-23 20:54:43,722 INFO L226 Difference]: Without dead ends: 1982 [2019-11-23 20:54:43,724 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:54:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-23 20:54:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1978. [2019-11-23 20:54:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-11-23 20:54:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2183 transitions. [2019-11-23 20:54:43,765 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2183 transitions. Word has length 144 [2019-11-23 20:54:43,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:43,766 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2183 transitions. [2019-11-23 20:54:43,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2183 transitions. [2019-11-23 20:54:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 20:54:43,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:43,771 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 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:54:43,771 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash 404814437, now seen corresponding path program 1 times [2019-11-23 20:54:43,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:43,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250827691] [2019-11-23 20:54:43,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:54:43,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250827691] [2019-11-23 20:54:43,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:43,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:43,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383813533] [2019-11-23 20:54:43,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:43,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:43,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:43,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:43,843 INFO L87 Difference]: Start difference. First operand 1978 states and 2183 transitions. Second operand 4 states. [2019-11-23 20:54:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:44,417 INFO L93 Difference]: Finished difference Result 4234 states and 4703 transitions. [2019-11-23 20:54:44,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:44,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 20:54:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:44,427 INFO L225 Difference]: With dead ends: 4234 [2019-11-23 20:54:44,427 INFO L226 Difference]: Without dead ends: 1836 [2019-11-23 20:54:44,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-11-23 20:54:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2019-11-23 20:54:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1836 states. [2019-11-23 20:54:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2009 transitions. [2019-11-23 20:54:44,469 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2009 transitions. Word has length 148 [2019-11-23 20:54:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:44,469 INFO L462 AbstractCegarLoop]: Abstraction has 1836 states and 2009 transitions. [2019-11-23 20:54:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2009 transitions. [2019-11-23 20:54:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 20:54:44,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:44,474 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:44,474 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:44,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1277248510, now seen corresponding path program 1 times [2019-11-23 20:54:44,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:44,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341006161] [2019-11-23 20:54:44,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:54:44,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341006161] [2019-11-23 20:54:44,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:44,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:44,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674481194] [2019-11-23 20:54:44,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:44,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:44,638 INFO L87 Difference]: Start difference. First operand 1836 states and 2009 transitions. Second operand 4 states. [2019-11-23 20:54:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:45,382 INFO L93 Difference]: Finished difference Result 3672 states and 4027 transitions. [2019-11-23 20:54:45,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:45,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-23 20:54:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:45,389 INFO L225 Difference]: With dead ends: 3672 [2019-11-23 20:54:45,389 INFO L226 Difference]: Without dead ends: 1554 [2019-11-23 20:54:45,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-11-23 20:54:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2019-11-23 20:54:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2019-11-23 20:54:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1619 transitions. [2019-11-23 20:54:45,418 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1619 transitions. Word has length 158 [2019-11-23 20:54:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:45,418 INFO L462 AbstractCegarLoop]: Abstraction has 1554 states and 1619 transitions. [2019-11-23 20:54:45,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1619 transitions. [2019-11-23 20:54:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-23 20:54:45,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:45,423 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-23 20:54:45,423 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:45,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2146398300, now seen corresponding path program 1 times [2019-11-23 20:54:45,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:45,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317036606] [2019-11-23 20:54:45,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 20:54:45,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317036606] [2019-11-23 20:54:45,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:45,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:45,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098574299] [2019-11-23 20:54:45,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:45,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:45,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:45,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:45,629 INFO L87 Difference]: Start difference. First operand 1554 states and 1619 transitions. Second operand 4 states. [2019-11-23 20:54:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:46,110 INFO L93 Difference]: Finished difference Result 2967 states and 3094 transitions. [2019-11-23 20:54:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:46,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-11-23 20:54:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:46,115 INFO L225 Difference]: With dead ends: 2967 [2019-11-23 20:54:46,115 INFO L226 Difference]: Without dead ends: 1555 [2019-11-23 20:54:46,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-23 20:54:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1414. [2019-11-23 20:54:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-11-23 20:54:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1464 transitions. [2019-11-23 20:54:46,142 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1464 transitions. Word has length 241 [2019-11-23 20:54:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:46,142 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 1464 transitions. [2019-11-23 20:54:46,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1464 transitions. [2019-11-23 20:54:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-23 20:54:46,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:46,148 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:54:46,148 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 995979598, now seen corresponding path program 1 times [2019-11-23 20:54:46,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:46,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936588168] [2019-11-23 20:54:46,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 174 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:46,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936588168] [2019-11-23 20:54:46,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521790881] [2019-11-23 20:54:46,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:54:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:46,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 20:54:46,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:54:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:54:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 190 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:46,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:54:46,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-11-23 20:54:46,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783402531] [2019-11-23 20:54:46,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 20:54:46,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 20:54:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-23 20:54:46,862 INFO L87 Difference]: Start difference. First operand 1414 states and 1464 transitions. Second operand 10 states. [2019-11-23 20:54:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:48,352 INFO L93 Difference]: Finished difference Result 2571 states and 2668 transitions. [2019-11-23 20:54:48,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:54:48,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2019-11-23 20:54:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:48,354 INFO L225 Difference]: With dead ends: 2571 [2019-11-23 20:54:48,354 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:54:48,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:54:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:54:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:54:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:54:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:54:48,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 246 [2019-11-23 20:54:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:48,358 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:54:48,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 20:54:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:54:48,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:54:48,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:54:48,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:54:48,904 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-23 20:54:49,139 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-23 20:54:49,143 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,143 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,143 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,143 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,144 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 20:54:49,145 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 20:54:49,146 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,147 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 20:54:49,148 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:54:49,149 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-23 20:54:49,150 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 20:54:49,151 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,152 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,153 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 20:54:49,154 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-23 20:54:49,155 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-23 20:54:49,156 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 20:54:49,156 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 20:54:49,156 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:54:49,156 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:54:49,156 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 20:54:49,157 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse6 (= ~a28~0 7))) (let ((.cse5 (<= ~a17~0 7)) (.cse9 (not (= ~a28~0 11))) (.cse2 (not (= ~a11~0 1))) (.cse4 (= ~a25~0 1)) (.cse0 (= ~a17~0 8)) (.cse10 (<= ~a25~0 0)) (.cse3 (= ~a21~0 1)) (.cse11 (= ~a28~0 10)) (.cse7 (not .cse6)) (.cse1 (= ~a19~0 1)) (.cse8 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse8 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse6 .cse4 .cse2) (and .cse7 .cse8 .cse3 .cse10 .cse9) (and (= ~a28~0 9) .cse1 .cse8 .cse4) (and .cse11 (<= ~a19~0 0) .cse7 .cse8 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse10 .cse3) (and .cse11 .cse7 .cse1 .cse8)))) [2019-11-23 20:54:49,157 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,157 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,157 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 20:54:49,157 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-23 20:54:49,157 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-23 20:54:49,158 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,159 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,160 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:54:49,160 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:54:49,160 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-23 20:54:49,160 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-23 20:54:49,160 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 20:54:49,160 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a28~0 7))) (let ((.cse5 (<= ~a17~0 7)) (.cse9 (not (= ~a28~0 11))) (.cse2 (not (= ~a11~0 1))) (.cse4 (= ~a25~0 1)) (.cse0 (= ~a17~0 8)) (.cse10 (<= ~a25~0 0)) (.cse3 (= ~a21~0 1)) (.cse11 (= ~a28~0 10)) (.cse7 (not .cse6)) (.cse1 (= ~a19~0 1)) (.cse8 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse8 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse6 .cse4 .cse2) (and .cse7 .cse8 .cse3 .cse10 .cse9) (and (= ~a28~0 9) .cse1 .cse8 .cse4) (and .cse11 (<= ~a19~0 0) .cse7 .cse8 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse10 .cse3) (and .cse11 .cse7 .cse1 .cse8)))) [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 20:54:49,161 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 20:54:49,162 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,163 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,164 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,165 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 20:54:49,166 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-23 20:54:49,167 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 20:54:49,168 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:54:49,169 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 20:54:49,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:54:49 BoogieIcfgContainer [2019-11-23 20:54:49,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:54:49,197 INFO L168 Benchmark]: Toolchain (without parser) took 13989.22 ms. Allocated memory was 144.7 MB in the beginning and 437.3 MB in the end (delta: 292.6 MB). Free memory was 101.2 MB in the beginning and 232.7 MB in the end (delta: -131.5 MB). Peak memory consumption was 161.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,198 INFO L168 Benchmark]: CDTParser took 1.66 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.84 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 163.3 MB in the end (delta: -62.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.90 ms. Allocated memory is still 202.4 MB. Free memory was 163.3 MB in the beginning and 157.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,200 INFO L168 Benchmark]: Boogie Preprocessor took 83.71 ms. Allocated memory is still 202.4 MB. Free memory was 157.8 MB in the beginning and 153.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,201 INFO L168 Benchmark]: RCFGBuilder took 1317.81 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 153.6 MB in the beginning and 165.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,202 INFO L168 Benchmark]: TraceAbstraction took 11753.43 ms. Allocated memory was 234.4 MB in the beginning and 437.3 MB in the end (delta: 202.9 MB). Free memory was 165.4 MB in the beginning and 232.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 135.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:49,207 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 733.84 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 163.3 MB in the end (delta: -62.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 95.90 ms. Allocated memory is still 202.4 MB. Free memory was 163.3 MB in the beginning and 157.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.71 ms. Allocated memory is still 202.4 MB. Free memory was 157.8 MB in the beginning and 153.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1317.81 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 153.6 MB in the beginning and 165.4 MB in the end (delta: -11.8 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11753.43 ms. Allocated memory was 234.4 MB in the beginning and 437.3 MB in the end (delta: 202.9 MB). Free memory was 165.4 MB in the beginning and 232.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 135.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8 && a19 == 1) && !(a11 == 1)) && a21 == 1) && a25 == 1) || (((a17 <= 7 && a19 == 1) && a28 == 7) && a25 == 1)) || (((a17 <= 7 && !(a28 == 7)) && a17 <= 8) && !(a28 == 11))) || ((((a17 == 8 && a28 == 7) && a21 == 1) && a25 == 1) && !(a11 == 1))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((!(a28 == 7) && a17 <= 8) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || (((a28 == 9 && a19 == 1) && a17 <= 8) && a25 == 1)) || ((((((a28 == 10 && a19 <= 0) && !(a28 == 7)) && a17 <= 8) && !(a11 == 1)) && a21 == 1) && a25 == 1)) || (((a17 == 8 && a28 == 7) && a25 <= 0) && a21 == 1)) || (((a28 == 10 && !(a28 == 7)) && a19 == 1) && a17 <= 8) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((a17 == 8 && a19 == 1) && !(a11 == 1)) && a21 == 1) && a25 == 1) || (((a17 <= 7 && a19 == 1) && a28 == 7) && a25 == 1)) || (((a17 <= 7 && !(a28 == 7)) && a17 <= 8) && !(a28 == 11))) || ((((a17 == 8 && a28 == 7) && a21 == 1) && a25 == 1) && !(a11 == 1))) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((!(a28 == 7) && a17 <= 8) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || (((a28 == 9 && a19 == 1) && a17 <= 8) && a25 == 1)) || ((((((a28 == 10 && a19 <= 0) && !(a28 == 7)) && a17 <= 8) && !(a11 == 1)) && a21 == 1) && a25 == 1)) || (((a17 == 8 && a28 == 7) && a25 <= 0) && a21 == 1)) || (((a28 == 10 && !(a28 == 7)) && a19 == 1) && a17 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 983 SDtfs, 2605 SDslu, 251 SDs, 0 SdLazy, 6368 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1978occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1001 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 59 NumberOfFragments, 325 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1624 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 1077857 SizeOfPredicates, 7 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 771/891 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...