/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_b2_o3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:17,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:17,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:17,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:17,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:17,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:17,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:17,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:17,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:17,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:17,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:17,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:17,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:17,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:17,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:17,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:17,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:17,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:17,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:17,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:17,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:17,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:17,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:17,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:17,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:17,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:17,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:17,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:17,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:17,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:17,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:17,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:17,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:17,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:17,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:17,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:17,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:17,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:17,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:17,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:17,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:17,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:41:17,210 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:17,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:17,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:17,216 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:17,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:17,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:17,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:17,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:17,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:17,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:17,219 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:17,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:17,219 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:17,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:17,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:17,220 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:17,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:17,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:17,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:17,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:17,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:17,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:17,222 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:41:17,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:17,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:17,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:17,761 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:17,762 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:17,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b2_o3.c [2020-11-07 00:41:17,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfaea881d/761e8733ae3740df84dbde88b2b2a170/FLAGbd616b540 [2020-11-07 00:41:18,516 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:18,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b2_o3.c [2020-11-07 00:41:18,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfaea881d/761e8733ae3740df84dbde88b2b2a170/FLAGbd616b540 [2020-11-07 00:41:18,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfaea881d/761e8733ae3740df84dbde88b2b2a170 [2020-11-07 00:41:18,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:18,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:18,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:18,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:18,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:18,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639fe77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18, skipping insertion in model container [2020-11-07 00:41:18,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:18,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:19,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:19,112 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:19,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:19,152 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:19,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19 WrapperNode [2020-11-07 00:41:19,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:19,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:19,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:19,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:19,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (1/1) ... [2020-11-07 00:41:19,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:19,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:19,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:19,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:19,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (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 [2020-11-07 00:41:19,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:19,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:19,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:19,290 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:41:19,290 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-11-07 00:41:19,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:19,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 00:41:19,291 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:19,291 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:19,291 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:19,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:41:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-11-07 00:41:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:19,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:19,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:19,567 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:19,567 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:19,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:19 BoogieIcfgContainer [2020-11-07 00:41:19,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:19,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:19,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:19,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:19,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:18" (1/3) ... [2020-11-07 00:41:19,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352eb0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:19, skipping insertion in model container [2020-11-07 00:41:19,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:19" (2/3) ... [2020-11-07 00:41:19,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352eb0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:19, skipping insertion in model container [2020-11-07 00:41:19,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:19" (3/3) ... [2020-11-07 00:41:19,582 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_b2_o3.c [2020-11-07 00:41:19,605 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:19,611 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:19,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:19,707 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:19,708 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:19,708 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:19,708 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:19,708 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:19,709 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:19,709 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:19,709 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-11-07 00:41:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:19,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:19,746 INFO L422 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] [2020-11-07 00:41:19,747 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 138014369, now seen corresponding path program 1 times [2020-11-07 00:41:19,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:19,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398007922] [2020-11-07 00:41:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:19,952 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:41:20,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398007922] [2020-11-07 00:41:20,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:20,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:20,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855019735] [2020-11-07 00:41:20,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:20,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:20,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:20,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:20,609 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2020-11-07 00:41:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:21,150 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-11-07 00:41:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:21,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:21,182 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:41:21,183 INFO L226 Difference]: Without dead ends: 45 [2020-11-07 00:41:21,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-07 00:41:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-07 00:41:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 00:41:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-11-07 00:41:21,301 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2020-11-07 00:41:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:21,302 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-07 00:41:21,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-11-07 00:41:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 00:41:21,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:21,306 INFO L422 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] [2020-11-07 00:41:21,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:21,307 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1111577060, now seen corresponding path program 1 times [2020-11-07 00:41:21,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:21,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617896729] [2020-11-07 00:41:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:21,313 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:41:21,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617896729] [2020-11-07 00:41:21,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:21,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:21,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237317709] [2020-11-07 00:41:21,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:21,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:21,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:21,562 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-11-07 00:41:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:21,944 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-11-07 00:41:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:21,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-07 00:41:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:21,948 INFO L225 Difference]: With dead ends: 73 [2020-11-07 00:41:21,948 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:41:21,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:41:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-11-07 00:41:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 00:41:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-11-07 00:41:21,971 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2020-11-07 00:41:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:21,971 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-11-07 00:41:21,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-11-07 00:41:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 00:41:21,973 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:21,973 INFO L422 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] [2020-11-07 00:41:21,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:21,974 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 982288804, now seen corresponding path program 1 times [2020-11-07 00:41:21,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:21,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516591782] [2020-11-07 00:41:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:21,980 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:41:22,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516591782] [2020-11-07 00:41:22,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:22,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:22,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901445415] [2020-11-07 00:41:22,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:22,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:22,259 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-11-07 00:41:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:22,834 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-11-07 00:41:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:22,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-11-07 00:41:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:22,837 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:41:22,838 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:41:22,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:41:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:41:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:41:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-11-07 00:41:22,857 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-11-07 00:41:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:22,857 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-07 00:41:22,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-11-07 00:41:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:22,861 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:22,861 INFO L422 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] [2020-11-07 00:41:22,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:22,862 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash 935446002, now seen corresponding path program 1 times [2020-11-07 00:41:22,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:22,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283749811] [2020-11-07 00:41:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:22,866 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:23,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283749811] [2020-11-07 00:41:23,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:23,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:23,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269481755] [2020-11-07 00:41:23,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:23,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:23,042 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-11-07 00:41:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:23,406 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-11-07 00:41:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:23,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-07 00:41:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:23,411 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:41:23,411 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:41:23,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:41:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-11-07 00:41:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 00:41:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-11-07 00:41:23,443 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2020-11-07 00:41:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:23,444 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-11-07 00:41:23,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-11-07 00:41:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:23,446 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:23,446 INFO L422 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] [2020-11-07 00:41:23,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:23,447 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1355534926, now seen corresponding path program 1 times [2020-11-07 00:41:23,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:23,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858189938] [2020-11-07 00:41:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:23,453 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:23,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858189938] [2020-11-07 00:41:23,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:23,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:23,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688350633] [2020-11-07 00:41:23,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:23,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:23,635 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-11-07 00:41:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:24,308 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-11-07 00:41:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:24,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-11-07 00:41:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:24,310 INFO L225 Difference]: With dead ends: 85 [2020-11-07 00:41:24,311 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:41:24,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:41:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-11-07 00:41:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:41:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-11-07 00:41:24,332 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2020-11-07 00:41:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:24,333 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-11-07 00:41:24,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-11-07 00:41:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:24,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:24,335 INFO L422 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] [2020-11-07 00:41:24,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:24,336 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:24,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:24,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1484823182, now seen corresponding path program 1 times [2020-11-07 00:41:24,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:24,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58153145] [2020-11-07 00:41:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:24,341 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:24,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58153145] [2020-11-07 00:41:24,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:24,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:24,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086166827] [2020-11-07 00:41:24,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:24,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:24,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:24,615 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2020-11-07 00:41:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:25,570 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-11-07 00:41:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:41:25,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-11-07 00:41:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:25,573 INFO L225 Difference]: With dead ends: 73 [2020-11-07 00:41:25,573 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 00:41:25,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:41:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 00:41:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2020-11-07 00:41:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:41:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-11-07 00:41:25,594 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 43 [2020-11-07 00:41:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:25,595 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-11-07 00:41:25,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-11-07 00:41:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:25,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:25,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:25,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:25,598 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash 334598913, now seen corresponding path program 1 times [2020-11-07 00:41:25,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:25,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99840989] [2020-11-07 00:41:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:25,603 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:25,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99840989] [2020-11-07 00:41:25,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:25,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:25,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984710683] [2020-11-07 00:41:25,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:25,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:25,806 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 9 states. [2020-11-07 00:41:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:26,389 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2020-11-07 00:41:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:26,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-11-07 00:41:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:26,393 INFO L225 Difference]: With dead ends: 93 [2020-11-07 00:41:26,393 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 00:41:26,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 00:41:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2020-11-07 00:41:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 00:41:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-11-07 00:41:26,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2020-11-07 00:41:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:26,429 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-11-07 00:41:26,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-11-07 00:41:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:41:26,435 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:26,436 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:26,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:26,440 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1956382015, now seen corresponding path program 1 times [2020-11-07 00:41:26,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:26,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [799605629] [2020-11-07 00:41:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:26,446 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:26,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [799605629] [2020-11-07 00:41:26,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:26,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:26,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215775744] [2020-11-07 00:41:26,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:26,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:26,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:26,781 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 12 states. [2020-11-07 00:41:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:27,618 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-11-07 00:41:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:41:27,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-11-07 00:41:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:27,621 INFO L225 Difference]: With dead ends: 101 [2020-11-07 00:41:27,621 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:41:27,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:41:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:41:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2020-11-07 00:41:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:41:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-11-07 00:41:27,643 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 52 [2020-11-07 00:41:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:27,643 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-11-07 00:41:27,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-11-07 00:41:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:27,645 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:27,645 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:41:27,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:27,646 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 519376963, now seen corresponding path program 2 times [2020-11-07 00:41:27,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:27,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812372886] [2020-11-07 00:41:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:27,649 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:41:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:27,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812372886] [2020-11-07 00:41:27,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:27,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:27,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372374061] [2020-11-07 00:41:27,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:27,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:27,909 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 12 states. [2020-11-07 00:41:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:28,748 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-11-07 00:41:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:41:28,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-11-07 00:41:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:28,750 INFO L225 Difference]: With dead ends: 90 [2020-11-07 00:41:28,750 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:41:28,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:41:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:41:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:41:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:41:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:41:28,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-11-07 00:41:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:28,757 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:41:28,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:41:28,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:41:28,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:41:28,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:41:29,678 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 17 [2020-11-07 00:41:30,261 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 24 [2020-11-07 00:41:30,517 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 17 [2020-11-07 00:41:30,627 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,627 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,627 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,627 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,627 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,628 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,628 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,628 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,629 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,629 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:41:30,629 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,629 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,629 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:41:30,629 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,630 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1))) [2020-11-07 00:41:30,630 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0))) [2020-11-07 00:41:30,631 INFO L262 CegarLoopResult]: At program point id2FINAL(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= |id2_#res| 2)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|))) [2020-11-07 00:41:30,632 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:41:30,632 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 3 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-11-07 00:41:30,632 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:41:30,632 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= |id2_#t~ret8| 0)) (and (<= 2 |id2_#t~ret8|) (<= |id2_#t~ret8| 2)) (and (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|))) [2020-11-07 00:41:30,632 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:41:30,632 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= 1 id2_~ret~1) (<= |id2_#t~ret8| 0) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0) (<= |id2_#t~ret8| 2) (<= 2 |id2_#t~ret8|)) (and (<= id2_~ret~1 2) (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|) (<= 2 id2_~ret~1))) [2020-11-07 00:41:30,633 INFO L262 CegarLoopResult]: At program point id2EXIT(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= |id2_#res| 2)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|))) [2020-11-07 00:41:30,633 INFO L269 CegarLoopResult]: At program point id2ENTRY(lines 16 21) the Hoare annotation is: true [2020-11-07 00:41:30,633 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,634 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,636 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,636 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:41:30,636 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 23 29) the Hoare annotation is: true [2020-11-07 00:41:30,636 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-11-07 00:41:30,637 INFO L262 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~result~0 2) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-11-07 00:41:30,637 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: false [2020-11-07 00:41:30,637 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 00:41:30,637 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 23 29) the Hoare annotation is: true [2020-11-07 00:41:30,637 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:41:30,637 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (and (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|)) (= |main_#t~ret10| 0) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|))) [2020-11-07 00:41:30,637 INFO L269 CegarLoopResult]: At program point L26-2(lines 23 29) the Hoare annotation is: true [2020-11-07 00:41:30,638 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|) (<= main_~result~0 1) .cse0) (and (= main_~result~0 0) (= |main_#t~ret10| 0)) (and (<= main_~result~0 2) (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|) .cse0))) [2020-11-07 00:41:30,638 INFO L262 CegarLoopResult]: At program point idFINAL(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 2 |id_#res|) (<= |id_#res| 2))) [2020-11-07 00:41:30,640 INFO L262 CegarLoopResult]: At program point idEXIT(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= 2 |id_#res|) (<= |id_#res| 2))) [2020-11-07 00:41:30,640 INFO L269 CegarLoopResult]: At program point idENTRY(lines 9 14) the Hoare annotation is: true [2020-11-07 00:41:30,641 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 00:41:30,641 INFO L262 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 00:41:30,641 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:41:30,641 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 00:41:30,641 INFO L269 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-11-07 00:41:30,641 INFO L262 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (or (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|)) (and (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= 0 |id_#t~ret7|) (<= |id_#t~ret7| 0))) [2020-11-07 00:41:30,641 INFO L269 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-11-07 00:41:30,642 INFO L262 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (or (and (<= 3 id_~ret~0) (<= (div id_~ret~0 4294967296) 0) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= id_~ret~0 2) (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 id_~ret~0)) (and (<= 0 |id_#t~ret7|) (<= id_~ret~0 1) (<= |id_#t~ret7| 0) (<= 1 id_~ret~0))) [2020-11-07 00:41:30,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:30 BoogieIcfgContainer [2020-11-07 00:41:30,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:30,672 INFO L168 Benchmark]: Toolchain (without parser) took 11783.03 ms. Allocated memory was 154.1 MB in the beginning and 287.3 MB in the end (delta: 133.2 MB). Free memory was 130.2 MB in the beginning and 265.0 MB in the end (delta: -134.8 MB). Peak memory consumption was 162.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:30,674 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 154.1 MB. Free memory is still 128.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:30,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.17 ms. Allocated memory is still 154.1 MB. Free memory was 129.6 MB in the beginning and 120.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:30,675 INFO L168 Benchmark]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 154.1 MB. Free memory was 120.2 MB in the beginning and 118.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:30,681 INFO L168 Benchmark]: RCFGBuilder took 374.52 ms. Allocated memory is still 154.1 MB. Free memory was 118.9 MB in the beginning and 104.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:30,685 INFO L168 Benchmark]: TraceAbstraction took 11096.58 ms. Allocated memory was 154.1 MB in the beginning and 287.3 MB in the end (delta: 133.2 MB). Free memory was 103.8 MB in the beginning and 265.0 MB in the end (delta: -161.2 MB). Peak memory consumption was 135.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:30,694 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 154.1 MB. Free memory is still 128.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 259.17 ms. Allocated memory is still 154.1 MB. Free memory was 129.6 MB in the beginning and 120.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 154.1 MB. Free memory was 120.2 MB in the beginning and 118.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 374.52 ms. Allocated memory is still 154.1 MB. Free memory was 118.9 MB in the beginning and 104.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11096.58 ms. Allocated memory was 154.1 MB in the beginning and 287.3 MB in the end (delta: 133.2 MB). Free memory was 103.8 MB in the beginning and 265.0 MB in the end (delta: -161.2 MB). Peak memory consumption was 135.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for id2 Derived contract for procedure id2: ((((1 <= ret && \result <= 1) && ret <= 1) && 1 <= \result) || (2 <= \result && \result <= 2)) || (\result <= 0 && 0 <= \result) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: ((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (0 <= \result && \result <= 0)) || (2 <= \result && \result <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 388 SDtfs, 359 SDslu, 889 SDs, 0 SdLazy, 2129 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 93 PreInvPairs, 196 NumberOfFragments, 462 HoareAnnotationTreeSize, 93 FomulaSimplifications, 26519 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 50 FomulaSimplificationsInter, 3047 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...