/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:35:52,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:35:52,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:35:52,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:35:52,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:35:52,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:35:52,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:35:52,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:35:52,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:35:52,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:35:52,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:35:52,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:35:52,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:35:52,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:35:52,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:35:52,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:35:52,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:35:52,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:35:52,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:35:52,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:35:52,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:35:52,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:35:52,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:35:52,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:35:52,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:35:52,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:35:52,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:35:52,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:35:52,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:35:52,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:35:52,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:35:52,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:35:52,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:35:52,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:35:52,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:35:52,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:35:52,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:35:52,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:35:52,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:35:52,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:35:52,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:35:52,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:35:52,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:35:52,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:35:52,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:35:52,417 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:35:52,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:35:52,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:35:52,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:35:52,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:35:52,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:35:52,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:35:52,419 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:35:52,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:35:52,420 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:35:52,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:35:52,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:35:52,420 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:35:52,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:35:52,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:35:52,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:35:52,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:35:52,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:35:52,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:35:52,422 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:35:52,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:35:52,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:35:52,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:35:52,859 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:35:52,860 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:35:52,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-10-24 00:35:52,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f60e18e/400fd660442445cb92e383fd6582d711/FLAG662bc6423 [2020-10-24 00:35:53,607 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:35:53,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-10-24 00:35:53,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f60e18e/400fd660442445cb92e383fd6582d711/FLAG662bc6423 [2020-10-24 00:35:53,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f60e18e/400fd660442445cb92e383fd6582d711 [2020-10-24 00:35:53,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:35:53,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:35:53,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:35:53,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:35:54,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:35:54,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:35:53" (1/1) ... [2020-10-24 00:35:54,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2020915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54, skipping insertion in model container [2020-10-24 00:35:54,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:35:53" (1/1) ... [2020-10-24 00:35:54,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:35:54,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:35:54,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:35:54,191 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:35:54,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:35:54,225 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:35:54,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54 WrapperNode [2020-10-24 00:35:54,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:35:54,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:35:54,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:35:54,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:35:54,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (1/1) ... [2020-10-24 00:35:54,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:35:54,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:35:54,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:35:54,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:35:54,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (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-10-24 00:35:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:35:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:35:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:35:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-10-24 00:35:54,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:35:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:35:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:35:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:35:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:35:54,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:35:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-10-24 00:35:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:35:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:35:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:35:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:35:54,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:35:54,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:35:54,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:35:54,875 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:35:54,877 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:35:54,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:35:54 BoogieIcfgContainer [2020-10-24 00:35:54,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:35:54,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:35:54,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:35:54,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:35:54,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:35:53" (1/3) ... [2020-10-24 00:35:54,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358fddfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:35:54, skipping insertion in model container [2020-10-24 00:35:54,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:35:54" (2/3) ... [2020-10-24 00:35:54,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358fddfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:35:54, skipping insertion in model container [2020-10-24 00:35:54,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:35:54" (3/3) ... [2020-10-24 00:35:54,893 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-10-24 00:35:54,906 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:35:54,912 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:35:54,925 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:35:54,991 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:35:54,992 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:35:54,992 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:35:54,992 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:35:54,992 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:35:54,992 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:35:54,992 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:35:54,993 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:35:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-10-24 00:35:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:35:55,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:55,028 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-10-24 00:35:55,028 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash -946996355, now seen corresponding path program 1 times [2020-10-24 00:35:55,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:55,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145921481] [2020-10-24 00:35:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:35:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:35:55,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145921481] [2020-10-24 00:35:55,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:35:55,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 00:35:55,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083391839] [2020-10-24 00:35:55,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:35:55,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:35:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:55,421 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 8 states. [2020-10-24 00:35:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:56,022 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-10-24 00:35:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:35:56,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-10-24 00:35:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:56,035 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:35:56,036 INFO L226 Difference]: Without dead ends: 48 [2020-10-24 00:35:56,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-24 00:35:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-24 00:35:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-24 00:35:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-10-24 00:35:56,098 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 33 [2020-10-24 00:35:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:56,098 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-10-24 00:35:56,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:35:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-10-24 00:35:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:35:56,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:56,103 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-10-24 00:35:56,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:35:56,103 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:56,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:56,104 INFO L82 PathProgramCache]: Analyzing trace with hash 300807360, now seen corresponding path program 1 times [2020-10-24 00:35:56,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:56,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117601840] [2020-10-24 00:35:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:56,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:56,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:35:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:56,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:35:56,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117601840] [2020-10-24 00:35:56,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:35:56,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:35:56,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107497392] [2020-10-24 00:35:56,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:35:56,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:56,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:35:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:35:56,383 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2020-10-24 00:35:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:56,979 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:35:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:35:56,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-10-24 00:35:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:56,982 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:35:56,982 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:35:56,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:35:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:35:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:35:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:35:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-10-24 00:35:57,001 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 43 [2020-10-24 00:35:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:57,002 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-10-24 00:35:57,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:35:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-10-24 00:35:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 00:35:57,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:57,005 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-10-24 00:35:57,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:35:57,005 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:57,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 855044706, now seen corresponding path program 1 times [2020-10-24 00:35:57,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:57,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474259271] [2020-10-24 00:35:57,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:35:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-24 00:35:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:35:57,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474259271] [2020-10-24 00:35:57,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:57,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 00:35:57,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109981296] [2020-10-24 00:35:57,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:35:57,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:35:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:35:57,141 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 6 states. [2020-10-24 00:35:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:57,405 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2020-10-24 00:35:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:35:57,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-10-24 00:35:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:57,408 INFO L225 Difference]: With dead ends: 83 [2020-10-24 00:35:57,408 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:35:57,410 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-10-24 00:35:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:35:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-24 00:35:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:35:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:35:57,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 52 [2020-10-24 00:35:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:57,427 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:35:57,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:35:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:35:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 00:35:57,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:57,430 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-10-24 00:35:57,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:35:57,430 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1772464485, now seen corresponding path program 1 times [2020-10-24 00:35:57,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:57,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411531534] [2020-10-24 00:35:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:35:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:35:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-24 00:35:57,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411531534] [2020-10-24 00:35:57,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:57,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:35:57,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753730717] [2020-10-24 00:35:57,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:35:57,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:35:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:35:57,718 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 14 states. [2020-10-24 00:35:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:35:59,362 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2020-10-24 00:35:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:35:59,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2020-10-24 00:35:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:35:59,373 INFO L225 Difference]: With dead ends: 99 [2020-10-24 00:35:59,373 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 00:35:59,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 00:35:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 00:35:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2020-10-24 00:35:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-24 00:35:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-10-24 00:35:59,402 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 62 [2020-10-24 00:35:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:35:59,403 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-10-24 00:35:59,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:35:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-10-24 00:35:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 00:35:59,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:35:59,407 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-10-24 00:35:59,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:35:59,407 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:35:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:35:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1793164904, now seen corresponding path program 2 times [2020-10-24 00:35:59,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:35:59,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499118148] [2020-10-24 00:35:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:35:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:35:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:35:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:35:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:35:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:35:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-24 00:35:59,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499118148] [2020-10-24 00:35:59,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:35:59,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:35:59,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401950978] [2020-10-24 00:35:59,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:35:59,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:35:59,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:35:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:35:59,612 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 8 states. [2020-10-24 00:36:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:00,153 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2020-10-24 00:36:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:36:00,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2020-10-24 00:36:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:00,158 INFO L225 Difference]: With dead ends: 135 [2020-10-24 00:36:00,158 INFO L226 Difference]: Without dead ends: 90 [2020-10-24 00:36:00,161 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-10-24 00:36:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-24 00:36:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-10-24 00:36:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-24 00:36:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2020-10-24 00:36:00,195 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 72 [2020-10-24 00:36:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:00,196 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2020-10-24 00:36:00,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:36:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2020-10-24 00:36:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 00:36:00,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:00,199 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-10-24 00:36:00,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:36:00,199 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1842837274, now seen corresponding path program 3 times [2020-10-24 00:36:00,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:00,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408021351] [2020-10-24 00:36:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-24 00:36:00,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408021351] [2020-10-24 00:36:00,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:00,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:36:00,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179344880] [2020-10-24 00:36:00,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:36:00,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:36:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:36:00,535 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand 15 states. [2020-10-24 00:36:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:02,251 INFO L93 Difference]: Finished difference Result 167 states and 258 transitions. [2020-10-24 00:36:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:36:02,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-10-24 00:36:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:02,264 INFO L225 Difference]: With dead ends: 167 [2020-10-24 00:36:02,265 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:36:02,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2020-10-24 00:36:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:36:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 88. [2020-10-24 00:36:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-24 00:36:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2020-10-24 00:36:02,359 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 72 [2020-10-24 00:36:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:02,360 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2020-10-24 00:36:02,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:36:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2020-10-24 00:36:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-24 00:36:02,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:02,364 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:36:02,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:36:02,364 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2031787973, now seen corresponding path program 4 times [2020-10-24 00:36:02,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:02,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952128574] [2020-10-24 00:36:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:36:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-10-24 00:36:02,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952128574] [2020-10-24 00:36:02,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:02,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 00:36:02,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111773931] [2020-10-24 00:36:02,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 00:36:02,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:02,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 00:36:02,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:36:02,518 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand 5 states. [2020-10-24 00:36:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:02,741 INFO L93 Difference]: Finished difference Result 154 states and 228 transitions. [2020-10-24 00:36:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 00:36:02,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-10-24 00:36:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:02,747 INFO L225 Difference]: With dead ends: 154 [2020-10-24 00:36:02,747 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:36:02,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-10-24 00:36:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:36:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-24 00:36:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 00:36:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2020-10-24 00:36:02,797 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 82 [2020-10-24 00:36:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:02,797 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2020-10-24 00:36:02,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 00:36:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2020-10-24 00:36:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-24 00:36:02,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:36:02,800 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-10-24 00:36:02,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:36:02,801 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:36:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:36:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1449257050, now seen corresponding path program 5 times [2020-10-24 00:36:02,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:36:02,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642127270] [2020-10-24 00:36:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:36:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:36:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 00:36:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:02,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-24 00:36:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-10-24 00:36:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 00:36:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:36:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-24 00:36:03,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642127270] [2020-10-24 00:36:03,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:36:03,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:36:03,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428139180] [2020-10-24 00:36:03,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:36:03,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:36:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:36:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:36:03,227 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand 17 states. [2020-10-24 00:36:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:36:05,156 INFO L93 Difference]: Finished difference Result 155 states and 244 transitions. [2020-10-24 00:36:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:36:05,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-10-24 00:36:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:36:05,159 INFO L225 Difference]: With dead ends: 155 [2020-10-24 00:36:05,159 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:36:05,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2020-10-24 00:36:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:36:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:36:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:36:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:36:05,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2020-10-24 00:36:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:36:05,166 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:36:05,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:36:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:36:05,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:36:05,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:36:05,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:36:08,316 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2020-10-24 00:36:08,562 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2020-10-24 00:36:08,854 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2020-10-24 00:36:09,140 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2020-10-24 00:36:09,312 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 23 [2020-10-24 00:36:09,470 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 21 [2020-10-24 00:36:09,851 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2020-10-24 00:36:10,425 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2020-10-24 00:36:10,584 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2020-10-24 00:36:10,770 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 23 [2020-10-24 00:36:11,169 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2020-10-24 00:36:11,173 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,174 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,174 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,174 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,174 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,175 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,175 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,175 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,175 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,175 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,176 INFO L270 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-10-24 00:36:11,176 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,176 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 00:36:11,176 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,176 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point L35-2(line 35) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-10-24 00:36:11,177 INFO L277 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-10-24 00:36:11,178 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 28 48) the Hoare annotation is: true [2020-10-24 00:36:11,178 INFO L270 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-10-24 00:36:11,178 INFO L270 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: false [2020-10-24 00:36:11,178 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 28 48) the Hoare annotation is: true [2020-10-24 00:36:11,178 INFO L270 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (<= 0 main_~n~0) [2020-10-24 00:36:11,178 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-10-24 00:36:11,178 INFO L270 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret12|)) [2020-10-24 00:36:11,179 INFO L277 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-10-24 00:36:11,179 INFO L270 CegarLoopResult]: At program point L42-2(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret12|)) [2020-10-24 00:36:11,179 INFO L270 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-10-24 00:36:11,179 INFO L277 CegarLoopResult]: At program point L36(lines 36 41) the Hoare annotation is: true [2020-10-24 00:36:11,179 INFO L277 CegarLoopResult]: At program point L30(lines 30 34) the Hoare annotation is: true [2020-10-24 00:36:11,179 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 28 48) the Hoare annotation is: true [2020-10-24 00:36:11,179 INFO L270 CegarLoopResult]: At program point L43(lines 43 47) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-10-24 00:36:11,180 INFO L277 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-10-24 00:36:11,180 INFO L277 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: true [2020-10-24 00:36:11,180 INFO L270 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-10-24 00:36:11,180 INFO L270 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-10-24 00:36:11,180 INFO L270 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-10-24 00:36:11,181 INFO L270 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-10-24 00:36:11,181 INFO L270 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-10-24 00:36:11,181 INFO L277 CegarLoopResult]: At program point ackermannENTRY(lines 17 25) the Hoare annotation is: true [2020-10-24 00:36:11,181 INFO L270 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-10-24 00:36:11,181 INFO L270 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-10-24 00:36:11,182 INFO L270 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 (<= 3 |ackermann_#t~ret9|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= 1 |ackermann_#in~m|)) (.cse4 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4))))) [2020-10-24 00:36:11,182 INFO L270 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-10-24 00:36:11,182 INFO L270 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 (<= 3 |ackermann_#t~ret9|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= 1 |ackermann_#in~m|)) (.cse4 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret8|) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4))))) [2020-10-24 00:36:11,182 INFO L270 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-10-24 00:36:11,182 INFO L270 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-10-24 00:36:11,183 INFO L270 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-10-24 00:36:11,183 INFO L270 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-10-24 00:36:11,183 INFO L270 CegarLoopResult]: At program point L24-6(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_#res|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-10-24 00:36:11,183 INFO L270 CegarLoopResult]: At program point L17(lines 17 25) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-10-24 00:36:11,183 INFO L270 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-10-24 00:36:11,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:36:11 BoogieIcfgContainer [2020-10-24 00:36:11,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:36:11,204 INFO L168 Benchmark]: Toolchain (without parser) took 17219.55 ms. Allocated memory was 151.0 MB in the beginning and 350.2 MB in the end (delta: 199.2 MB). Free memory was 127.8 MB in the beginning and 181.0 MB in the end (delta: -53.1 MB). Peak memory consumption was 208.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:36:11,205 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.3 MB in the beginning and 123.2 MB in the end (delta: 131.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:36:11,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.11 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 118.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:36:11,207 INFO L168 Benchmark]: Boogie Preprocessor took 36.76 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:36:11,208 INFO L168 Benchmark]: RCFGBuilder took 610.34 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 101.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:36:11,209 INFO L168 Benchmark]: TraceAbstraction took 16317.95 ms. Allocated memory was 151.0 MB in the beginning and 350.2 MB in the end (delta: 199.2 MB). Free memory was 100.5 MB in the beginning and 181.0 MB in the end (delta: -80.5 MB). Peak memory consumption was 181.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:36:11,212 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.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.3 MB in the beginning and 123.2 MB in the end (delta: 131.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 229.11 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 118.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.76 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 610.34 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 101.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16317.95 ms. Allocated memory was 151.0 MB in the beginning and 350.2 MB in the end (delta: 199.2 MB). Free memory was 100.5 MB in the beginning and 181.0 MB in the end (delta: -80.5 MB). Peak memory consumption was 181.1 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.1s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 361 SDtfs, 637 SDslu, 683 SDs, 0 SdLazy, 2536 SolverSat, 383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 4.8s 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, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 606 PreInvPairs, 1065 NumberOfFragments, 682 HoareAnnotationTreeSize, 606 FomulaSimplifications, 187745 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 56 FomulaSimplificationsInter, 6809 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 80361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 355/435 InterpolantCoveringCapability, 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...