/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/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:25:26,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:25:26,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:25:26,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:25:26,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:25:26,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:25:26,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:25:26,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:25:26,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:25:26,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:25:26,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:25:26,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:25:26,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:25:26,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:25:26,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:25:26,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:25:26,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:25:26,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:25:26,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:25:26,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:25:26,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:25:26,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:25:26,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:25:26,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:25:26,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:25:26,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:25:26,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:25:26,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:25:26,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:25:26,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:25:26,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:25:26,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:25:26,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:25:26,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:25:26,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:25:26,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:25:26,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:25:26,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:25:26,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:25:26,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:25:26,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:25:26,390 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:25:26,406 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:25:26,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:25:26,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:25:26,408 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:25:26,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:25:26,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:25:26,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:25:26,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:25:26,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:25:26,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:25:26,409 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:25:26,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:25:26,410 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:25:26,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:25:26,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:25:26,410 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:25:26,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:25:26,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:25:26,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:26,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:25:26,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:25:26,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:25:26,412 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:25:26,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:25:26,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:25:26,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:25:26,870 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:25:26,871 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:25:26,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-11-07 00:25:26,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1c989a0/c34286499d544a38869d82c9bc9e3aa4/FLAGc44bd9dc6 [2020-11-07 00:25:27,502 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:25:27,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-11-07 00:25:27,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1c989a0/c34286499d544a38869d82c9bc9e3aa4/FLAGc44bd9dc6 [2020-11-07 00:25:27,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1c989a0/c34286499d544a38869d82c9bc9e3aa4 [2020-11-07 00:25:27,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:25:27,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:25:27,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:27,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:25:27,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:25:27,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:27" (1/1) ... [2020-11-07 00:25:27,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b0d402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:27, skipping insertion in model container [2020-11-07 00:25:27,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:27" (1/1) ... [2020-11-07 00:25:27,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:25:27,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:25:28,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:28,150 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:25:28,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:28,187 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:25:28,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28 WrapperNode [2020-11-07 00:25:28,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:28,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:25:28,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:25:28,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:25:28,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (1/1) ... [2020-11-07 00:25:28,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:25:28,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:25:28,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:25:28,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:25:28,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (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:25:28,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:25:28,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:25:28,317 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:25:28,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-11-07 00:25:28,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:25:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:25:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:25:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:25:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:25:28,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:25:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-11-07 00:25:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:25:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:25:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:25:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:25:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:25:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:25:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:25:28,656 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:25:28,656 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:25:28,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:28 BoogieIcfgContainer [2020-11-07 00:25:28,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:25:28,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:25:28,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:25:28,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:25:28,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:25:27" (1/3) ... [2020-11-07 00:25:28,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d835f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:28, skipping insertion in model container [2020-11-07 00:25:28,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:28" (2/3) ... [2020-11-07 00:25:28,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d835f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:28, skipping insertion in model container [2020-11-07 00:25:28,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:28" (3/3) ... [2020-11-07 00:25:28,668 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-11-07 00:25:28,701 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:25:28,707 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:25:28,721 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:25:28,748 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:25:28,749 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:25:28,749 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:25:28,749 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:25:28,749 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:25:28,749 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:25:28,749 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:25:28,750 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:25:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-11-07 00:25:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:25:28,777 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:28,778 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] [2020-11-07 00:25:28,778 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash -946996355, now seen corresponding path program 1 times [2020-11-07 00:25:28,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:28,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1804641366] [2020-11-07 00:25:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:28,879 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:29,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:29,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:29,289 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:25:29,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1804641366] [2020-11-07 00:25:29,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:29,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:29,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899647665] [2020-11-07 00:25:29,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:29,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:29,319 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 8 states. [2020-11-07 00:25:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:30,313 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-11-07 00:25:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:25:30,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-11-07 00:25:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:30,327 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:25:30,328 INFO L226 Difference]: Without dead ends: 48 [2020-11-07 00:25:30,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-07 00:25:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-07 00:25:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-07 00:25:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-11-07 00:25:30,398 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 33 [2020-11-07 00:25:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:30,399 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-11-07 00:25:30,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-11-07 00:25:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:25:30,405 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:30,406 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:30,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:25:30,408 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 300807360, now seen corresponding path program 1 times [2020-11-07 00:25:30,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:30,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1381896939] [2020-11-07 00:25:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:30,426 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:30,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:30,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:30,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:25:30,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1381896939] [2020-11-07 00:25:30,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:30,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:25:30,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034504413] [2020-11-07 00:25:30,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:25:30,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:25:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:30,750 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2020-11-07 00:25:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:31,432 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 00:25:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:25:31,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-11-07 00:25:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:31,435 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:25:31,435 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:25:31,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:25:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 00:25:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:25:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-11-07 00:25:31,460 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 43 [2020-11-07 00:25:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:31,460 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-11-07 00:25:31,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:25:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-11-07 00:25:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 00:25:31,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:31,464 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:31,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:25:31,464 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash 855044706, now seen corresponding path program 1 times [2020-11-07 00:25:31,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:31,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688464863] [2020-11-07 00:25:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:31,468 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:31,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:31,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:31,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:31,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 00:25:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:25:31,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1688464863] [2020-11-07 00:25:31,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:31,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:31,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499770626] [2020-11-07 00:25:31,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:31,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:31,605 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2020-11-07 00:25:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:31,883 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2020-11-07 00:25:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:31,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-11-07 00:25:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:31,886 INFO L225 Difference]: With dead ends: 83 [2020-11-07 00:25:31,886 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 00:25:31,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:25:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 00:25:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-11-07 00:25:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 00:25:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 00:25:31,912 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 52 [2020-11-07 00:25:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:31,913 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 00:25:31,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 00:25:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 00:25:31,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:31,927 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2020-11-07 00:25:31,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:25:31,928 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1772464485, now seen corresponding path program 1 times [2020-11-07 00:25:31,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:31,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108246327] [2020-11-07 00:25:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:31,935 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-07 00:25:32,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108246327] [2020-11-07 00:25:32,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:32,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:25:32,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343326849] [2020-11-07 00:25:32,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:25:32,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:32,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:25:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:25:32,334 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 14 states. [2020-11-07 00:25:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:33,943 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2020-11-07 00:25:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:25:33,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2020-11-07 00:25:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:33,947 INFO L225 Difference]: With dead ends: 97 [2020-11-07 00:25:33,948 INFO L226 Difference]: Without dead ends: 90 [2020-11-07 00:25:33,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=839, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:25:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-07 00:25:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2020-11-07 00:25:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 00:25:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-11-07 00:25:33,978 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 62 [2020-11-07 00:25:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:33,979 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-11-07 00:25:33,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:25:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-11-07 00:25:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:25:33,981 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:33,981 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2020-11-07 00:25:33,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:25:33,982 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1793164904, now seen corresponding path program 2 times [2020-11-07 00:25:33,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:33,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1966582942] [2020-11-07 00:25:33,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:33,986 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-07 00:25:34,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1966582942] [2020-11-07 00:25:34,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:34,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:25:34,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303555819] [2020-11-07 00:25:34,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:25:34,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:25:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:25:34,144 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 8 states. [2020-11-07 00:25:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:34,686 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2020-11-07 00:25:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:34,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2020-11-07 00:25:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:34,690 INFO L225 Difference]: With dead ends: 135 [2020-11-07 00:25:34,690 INFO L226 Difference]: Without dead ends: 90 [2020-11-07 00:25:34,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:25:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-07 00:25:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-11-07 00:25:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-07 00:25:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2020-11-07 00:25:34,733 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 72 [2020-11-07 00:25:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:34,738 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2020-11-07 00:25:34,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:25:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2020-11-07 00:25:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:25:34,746 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:34,746 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2020-11-07 00:25:34,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:25:34,747 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:34,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1842837274, now seen corresponding path program 3 times [2020-11-07 00:25:34,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:34,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [499090096] [2020-11-07 00:25:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:34,752 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-07 00:25:35,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [499090096] [2020-11-07 00:25:35,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:35,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:25:35,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070949610] [2020-11-07 00:25:35,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:25:35,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:35,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:25:35,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:25:35,124 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand 15 states. [2020-11-07 00:25:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:36,763 INFO L93 Difference]: Finished difference Result 164 states and 255 transitions. [2020-11-07 00:25:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:25:36,764 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-11-07 00:25:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:36,768 INFO L225 Difference]: With dead ends: 164 [2020-11-07 00:25:36,768 INFO L226 Difference]: Without dead ends: 157 [2020-11-07 00:25:36,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 00:25:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-07 00:25:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 88. [2020-11-07 00:25:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-07 00:25:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2020-11-07 00:25:36,810 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 72 [2020-11-07 00:25:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:36,811 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2020-11-07 00:25:36,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:25:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2020-11-07 00:25:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-07 00:25:36,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:36,813 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 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] [2020-11-07 00:25:36,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:25:36,813 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1537627870, now seen corresponding path program 4 times [2020-11-07 00:25:36,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:36,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1207165665] [2020-11-07 00:25:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:36,817 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-07 00:25:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-11-07 00:25:36,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1207165665] [2020-11-07 00:25:36,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:36,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 00:25:36,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296452417] [2020-11-07 00:25:36,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 00:25:36,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 00:25:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 00:25:36,965 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand 5 states. [2020-11-07 00:25:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:37,187 INFO L93 Difference]: Finished difference Result 154 states and 228 transitions. [2020-11-07 00:25:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 00:25:37,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2020-11-07 00:25:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:37,191 INFO L225 Difference]: With dead ends: 154 [2020-11-07 00:25:37,191 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:25:37,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:25:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 00:25:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 00:25:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2020-11-07 00:25:37,234 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 92 [2020-11-07 00:25:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:37,234 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2020-11-07 00:25:37,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 00:25:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2020-11-07 00:25:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-07 00:25:37,238 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:37,238 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 00:25:37,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:25:37,239 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1449257050, now seen corresponding path program 5 times [2020-11-07 00:25:37,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:37,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1661123188] [2020-11-07 00:25:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:37,244 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 00:25:37,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1661123188] [2020-11-07 00:25:37,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:37,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:25:37,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528481985] [2020-11-07 00:25:37,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:25:37,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:25:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:37,620 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand 17 states. [2020-11-07 00:25:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:39,449 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2020-11-07 00:25:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:25:39,450 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-11-07 00:25:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:39,451 INFO L225 Difference]: With dead ends: 154 [2020-11-07 00:25:39,451 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:25:39,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=377, Invalid=1345, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 00:25:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:25:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:25:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:25:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:25:39,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2020-11-07 00:25:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:39,457 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:25:39,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:25:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:25:39,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:25:39,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:25:39,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:25:42,747 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2020-11-07 00:25:43,014 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2020-11-07 00:25:43,319 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2020-11-07 00:25:43,599 WARN L194 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2020-11-07 00:25:43,783 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 23 [2020-11-07 00:25:43,900 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 14 [2020-11-07 00:25:44,259 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2020-11-07 00:25:44,830 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2020-11-07 00:25:44,996 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2020-11-07 00:25:45,168 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 23 [2020-11-07 00:25:45,568 WARN L194 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2020-11-07 00:25:45,574 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,575 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,576 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,576 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:25:45,576 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,576 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:25:45,576 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,576 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,576 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point L35-2(line 35) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 28 48) the Hoare annotation is: true [2020-11-07 00:25:45,577 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-11-07 00:25:45,578 INFO L262 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: false [2020-11-07 00:25:45,578 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 28 48) the Hoare annotation is: true [2020-11-07 00:25:45,578 INFO L262 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (<= 0 main_~n~0) [2020-11-07 00:25:45,578 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-11-07 00:25:45,578 INFO L262 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret12|)) [2020-11-07 00:25:45,578 INFO L269 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-11-07 00:25:45,578 INFO L262 CegarLoopResult]: At program point L42-2(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret12|)) [2020-11-07 00:25:45,578 INFO L262 CegarLoopResult]: At program point L42-3(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret12|) (<= 1 main_~result~0)) [2020-11-07 00:25:45,579 INFO L269 CegarLoopResult]: At program point L36(lines 36 41) the Hoare annotation is: true [2020-11-07 00:25:45,579 INFO L269 CegarLoopResult]: At program point L30(lines 30 34) the Hoare annotation is: true [2020-11-07 00:25:45,579 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 28 48) the Hoare annotation is: true [2020-11-07 00:25:45,579 INFO L262 CegarLoopResult]: At program point L43(lines 43 47) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-11-07 00:25:45,579 INFO L269 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-11-07 00:25:45,579 INFO L269 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: true [2020-11-07 00:25:45,579 INFO L262 CegarLoopResult]: At program point ackermannEXIT(lines 17 25) the Hoare annotation is: (let ((.cse5 (<= (+ |ackermann_#in~n| 1) |ackermann_#res|)) (.cse3 (= |ackermann_#in~m| 0))) (and (let ((.cse0 (<= 2 |ackermann_#res|)) (.cse4 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse1 (or (and .cse0 .cse4) (and .cse5 .cse4))) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 (<= |ackermann_#in~m| 1) .cse1 (= |ackermann_#in~n| 0) .cse2) (and .cse1 .cse2 .cse3) (and (<= 3 |ackermann_#res|) .cse4 .cse2)))) (or (and .cse5 .cse3) (<= 1 |ackermann_#in~m|)))) [2020-11-07 00:25:45,580 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 00:25:45,580 INFO L262 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret8|))) (and (or (= |ackermann_#in~n| 1) (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|)) .cse0) (let ((.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 1 |ackermann_#in~m|)) (.cse3 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse1 .cse2 .cse3))))) [2020-11-07 00:25:45,580 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 00:25:45,580 INFO L262 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret8|))) (and (or (= |ackermann_#in~n| 1) (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|)) .cse0) (let ((.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 1 |ackermann_#in~m|)) (.cse3 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse1 .cse2 .cse3))))) [2020-11-07 00:25:45,581 INFO L269 CegarLoopResult]: At program point ackermannENTRY(lines 17 25) the Hoare annotation is: true [2020-11-07 00:25:45,581 INFO L262 CegarLoopResult]: At program point L21(lines 21 23) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 00:25:45,581 INFO L262 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 1 |ackermann_#in~m|)) (.cse3 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) .cse0 .cse1 (<= 2 |ackermann_#t~ret7|) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 3 |ackermann_#t~ret7|)))) [2020-11-07 00:25:45,581 INFO L262 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret8|))) (and (or (= |ackermann_#in~n| 1) (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|)) .cse0) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse1) (and .cse0 .cse1))) (<= 3 |ackermann_#t~ret9|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|))) [2020-11-07 00:25:45,581 INFO L262 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 1 |ackermann_#in~m|)) (.cse3 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) .cse0 .cse1 (<= 2 |ackermann_#t~ret7|) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 3 |ackermann_#t~ret7|)))) [2020-11-07 00:25:45,582 INFO L262 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret8|))) (and (or (= |ackermann_#in~n| 1) (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|)) .cse0) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse1) (and .cse0 .cse1))) (<= 3 |ackermann_#t~ret9|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|))) [2020-11-07 00:25:45,582 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (= |ackermann_#in~m| 0)) [2020-11-07 00:25:45,582 INFO L262 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (and (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse1 (= ackermann_~n |ackermann_#in~n|))) (or (and (<= 2 |ackermann_#res|) (<= |ackermann_#in~m| 1) .cse0 .cse1 (<= 2 |ackermann_#t~ret7|)) (and .cse0 (<= 3 |ackermann_#res|) .cse1 (<= 3 |ackermann_#t~ret7|))))) [2020-11-07 00:25:45,582 INFO L262 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (and (let ((.cse0 (<= 1 |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse0) (and (<= 3 |ackermann_#t~ret8|) .cse0))) (<= 3 |ackermann_#t~ret9|) (<= 3 |ackermann_#res|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 00:25:45,582 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 00:25:45,582 INFO L262 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (and (<= 3 |ackermann_#t~ret9|) (<= 3 |ackermann_#res|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (<= 1 |ackermann_#in~m|)) [2020-11-07 00:25:45,583 INFO L262 CegarLoopResult]: At program point L17(lines 17 25) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-11-07 00:25:45,583 INFO L262 CegarLoopResult]: At program point ackermannFINAL(lines 17 25) the Hoare annotation is: (let ((.cse5 (<= (+ |ackermann_#in~n| 1) |ackermann_#res|)) (.cse3 (= |ackermann_#in~m| 0))) (and (let ((.cse0 (<= 2 |ackermann_#res|)) (.cse4 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse1 (or (and .cse0 .cse4) (and .cse5 .cse4))) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 (<= |ackermann_#in~m| 1) .cse1 (= |ackermann_#in~n| 0) .cse2) (and .cse1 .cse2 .cse3) (and (<= 3 |ackermann_#res|) .cse4 .cse2)))) (or (and .cse5 .cse3) (<= 1 |ackermann_#in~m|)))) [2020-11-07 00:25:45,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:25:45 BoogieIcfgContainer [2020-11-07 00:25:45,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:25:45,604 INFO L168 Benchmark]: Toolchain (without parser) took 17678.82 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 128.1 MB in the beginning and 274.9 MB in the end (delta: -146.8 MB). Peak memory consumption was 186.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:45,604 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory was 102.5 MB in the beginning and 102.5 MB in the end (delta: 69.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:25:45,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.36 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:45,606 INFO L168 Benchmark]: Boogie Preprocessor took 35.65 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 116.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:45,607 INFO L168 Benchmark]: RCFGBuilder took 432.73 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 133.8 MB in the end (delta: -17.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:45,608 INFO L168 Benchmark]: TraceAbstraction took 16941.55 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 133.4 MB in the beginning and 274.9 MB in the end (delta: -141.6 MB). Peak memory consumption was 191.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:25:45,611 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 125.8 MB. Free memory was 102.5 MB in the beginning and 102.5 MB in the end (delta: 69.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 257.36 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.65 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 116.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 432.73 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 133.8 MB in the end (delta: -17.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16941.55 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 133.4 MB in the beginning and 274.9 MB in the end (delta: -141.6 MB). Peak memory consumption was 191.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for ackermann Derived contract for procedure ackermann: ((((((2 <= \result && \old(m) <= 1) && ((2 <= \result && n == \old(n)) || (\old(n) + 1 <= \result && n == \old(n)))) && \old(n) == 0) && m == \old(m)) || ((((2 <= \result && n == \old(n)) || (\old(n) + 1 <= \result && n == \old(n))) && m == \old(m)) && \old(m) == 0)) || ((3 <= \result && n == \old(n)) && m == \old(m))) && ((\old(n) + 1 <= \result && \old(m) == 0) || 1 <= \old(m)) - ProcedureContractResult [Line: 28]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.7s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 357 SDtfs, 631 SDslu, 658 SDs, 0 SdLazy, 2405 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=5, 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, 8 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 606 PreInvPairs, 1047 NumberOfFragments, 652 HoareAnnotationTreeSize, 606 FomulaSimplifications, 177471 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 56 FomulaSimplificationsInter, 6429 FormulaSimplificationTreeSizeReductionInter, 3.1s 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...