/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/Ackermann04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:48:26,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:48:26,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:48:26,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:48:26,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:48:26,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:48:26,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:48:26,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:48:26,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:48:26,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:48:26,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:48:26,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:48:26,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:48:26,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:48:26,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:48:26,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:48:26,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:48:26,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:48:26,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:48:26,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:48:26,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:48:26,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:48:26,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:48:26,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:48:26,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:48:26,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:48:26,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:48:26,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:48:26,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:48:26,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:48:26,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:48:26,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:48:26,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:48:26,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:48:26,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:48:26,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:48:26,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:48:26,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:48:26,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:48:26,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:48:26,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:48:26,817 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 04:48:26,838 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:48:26,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:48:26,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:48:26,844 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:48:26,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:48:26,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:48:26,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:48:26,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:48:26,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:48:26,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:48:26,846 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:48:26,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:48:26,846 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:48:26,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:48:26,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:48:26,848 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:48:26,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:48:26,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:48:26,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:48:26,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:48:26,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:48:26,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:48:26,849 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-11-07 04:48:27,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:48:27,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:48:27,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:48:27,284 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:48:27,285 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:48:27,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann04.c [2020-11-07 04:48:27,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6908051a/23f7f2d2191740d7b824681296d96e55/FLAG315ac15f0 [2020-11-07 04:48:27,987 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:48:27,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann04.c [2020-11-07 04:48:27,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6908051a/23f7f2d2191740d7b824681296d96e55/FLAG315ac15f0 [2020-11-07 04:48:28,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6908051a/23f7f2d2191740d7b824681296d96e55 [2020-11-07 04:48:28,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:48:28,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:48:28,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:48:28,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:48:28,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:48:28,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459a48be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28, skipping insertion in model container [2020-11-07 04:48:28,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:48:28,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:48:28,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:48:28,558 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:48:28,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:48:28,593 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:48:28,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28 WrapperNode [2020-11-07 04:48:28,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:48:28,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:48:28,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:48:28,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:48:28,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (1/1) ... [2020-11-07 04:48:28,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:48:28,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:48:28,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:48:28,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:48:28,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48: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 04:48:28,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:48:28,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:48:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:48:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-11-07 04:48:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:48:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:48:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:48:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:48:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:48:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 04:48:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-11-07 04:48:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:48:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:48:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:48:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:48:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:48:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:48:28,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:48:28,991 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:48:28,991 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 04:48:28,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:28 BoogieIcfgContainer [2020-11-07 04:48:28,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:48:28,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:48:28,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:48:28,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:48:29,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:48:28" (1/3) ... [2020-11-07 04:48:29,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78713745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:29, skipping insertion in model container [2020-11-07 04:48:29,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:48:28" (2/3) ... [2020-11-07 04:48:29,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78713745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:48:29, skipping insertion in model container [2020-11-07 04:48:29,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:48:28" (3/3) ... [2020-11-07 04:48:29,005 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2020-11-07 04:48:29,025 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:48:29,029 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:48:29,047 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:48:29,111 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:48:29,112 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:48:29,112 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:48:29,112 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:48:29,112 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:48:29,113 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:48:29,113 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:48:29,113 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:48:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-11-07 04:48:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 04:48:29,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:29,162 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 04:48:29,163 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -946996355, now seen corresponding path program 1 times [2020-11-07 04:48:29,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:29,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [325430547] [2020-11-07 04:48:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:29,578 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 04:48:29,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [325430547] [2020-11-07 04:48:29,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:48:29,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 04:48:29,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515866040] [2020-11-07 04:48:29,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:48:29,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:29,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:48:29,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:48:29,617 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 6 states. [2020-11-07 04:48:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:30,279 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2020-11-07 04:48:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:48:30,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-11-07 04:48:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:30,303 INFO L225 Difference]: With dead ends: 101 [2020-11-07 04:48:30,304 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 04:48:30,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:48:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 04:48:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 04:48:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 04:48:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2020-11-07 04:48:30,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 33 [2020-11-07 04:48:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:30,407 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2020-11-07 04:48:30,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:48:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-11-07 04:48:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 04:48:30,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:30,415 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 04:48:30,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:48:30,416 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash 300807360, now seen corresponding path program 1 times [2020-11-07 04:48:30,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:30,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [37535437] [2020-11-07 04:48:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 04:48:30,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [37535437] [2020-11-07 04:48:30,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:30,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 04:48:30,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124471231] [2020-11-07 04:48:30,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 04:48:30,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:30,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 04:48:30,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 04:48:30,580 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2020-11-07 04:48:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:30,855 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2020-11-07 04:48:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 04:48:30,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-07 04:48:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:30,859 INFO L225 Difference]: With dead ends: 93 [2020-11-07 04:48:30,859 INFO L226 Difference]: Without dead ends: 56 [2020-11-07 04:48:30,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:48:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-07 04:48:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-07 04:48:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 04:48:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-11-07 04:48:30,880 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 43 [2020-11-07 04:48:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:30,880 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-11-07 04:48:30,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 04:48:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-11-07 04:48:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 04:48:30,883 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:30,884 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 04:48:30,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:48:30,884 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1772464485, now seen corresponding path program 1 times [2020-11-07 04:48:30,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:30,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693044585] [2020-11-07 04:48:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:30,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 04:48:31,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693044585] [2020-11-07 04:48:31,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:31,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:48:31,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457310005] [2020-11-07 04:48:31,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:48:31,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:48:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:48:31,079 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 7 states. [2020-11-07 04:48:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:31,465 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2020-11-07 04:48:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:48:31,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-11-07 04:48:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:31,469 INFO L225 Difference]: With dead ends: 85 [2020-11-07 04:48:31,469 INFO L226 Difference]: Without dead ends: 78 [2020-11-07 04:48:31,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:48:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-07 04:48:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-11-07 04:48:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-07 04:48:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2020-11-07 04:48:31,494 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 62 [2020-11-07 04:48:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:31,494 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2020-11-07 04:48:31,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:48:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2020-11-07 04:48:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 04:48:31,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:31,499 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2020-11-07 04:48:31,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:48:31,499 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1545390750, now seen corresponding path program 2 times [2020-11-07 04:48:31,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:31,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [992017821] [2020-11-07 04:48:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-11-07 04:48:31,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [992017821] [2020-11-07 04:48:31,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:31,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 04:48:31,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079405731] [2020-11-07 04:48:31,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:48:31,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:31,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:48:31,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:48:31,801 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 7 states. [2020-11-07 04:48:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:32,237 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2020-11-07 04:48:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:48:32,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-11-07 04:48:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:32,242 INFO L225 Difference]: With dead ends: 117 [2020-11-07 04:48:32,242 INFO L226 Difference]: Without dead ends: 110 [2020-11-07 04:48:32,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:48:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-07 04:48:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-07 04:48:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-07 04:48:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2020-11-07 04:48:32,280 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 81 [2020-11-07 04:48:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:32,280 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2020-11-07 04:48:32,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:48:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2020-11-07 04:48:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-11-07 04:48:32,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:32,285 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 11, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 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 04:48:32,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:48:32,285 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:32,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1932765146, now seen corresponding path program 3 times [2020-11-07 04:48:32,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:32,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923054749] [2020-11-07 04:48:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 04:48:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 197 proven. 298 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2020-11-07 04:48:32,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923054749] [2020-11-07 04:48:32,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:32,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 04:48:32,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004057624] [2020-11-07 04:48:32,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 04:48:32,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 04:48:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-07 04:48:32,782 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand 10 states. [2020-11-07 04:48:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:33,817 INFO L93 Difference]: Finished difference Result 230 states and 451 transitions. [2020-11-07 04:48:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 04:48:33,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2020-11-07 04:48:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:33,824 INFO L225 Difference]: With dead ends: 230 [2020-11-07 04:48:33,824 INFO L226 Difference]: Without dead ends: 126 [2020-11-07 04:48:33,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-11-07 04:48:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-07 04:48:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2020-11-07 04:48:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 04:48:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2020-11-07 04:48:33,867 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 188 [2020-11-07 04:48:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:33,868 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2020-11-07 04:48:33,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 04:48:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2020-11-07 04:48:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-07 04:48:33,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:33,871 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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 04:48:33,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:48:33,872 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:33,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1837059662, now seen corresponding path program 4 times [2020-11-07 04:48:33,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:33,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15110525] [2020-11-07 04:48:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:33,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-07 04:48:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 110 proven. 71 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-11-07 04:48:34,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15110525] [2020-11-07 04:48:34,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:34,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:48:34,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811323951] [2020-11-07 04:48:34,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:48:34,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:48:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:48:34,386 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand 16 states. [2020-11-07 04:48:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:36,050 INFO L93 Difference]: Finished difference Result 264 states and 439 transitions. [2020-11-07 04:48:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 04:48:36,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2020-11-07 04:48:36,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:36,061 INFO L225 Difference]: With dead ends: 264 [2020-11-07 04:48:36,061 INFO L226 Difference]: Without dead ends: 164 [2020-11-07 04:48:36,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=377, Invalid=1263, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 04:48:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-11-07 04:48:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2020-11-07 04:48:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 04:48:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2020-11-07 04:48:36,136 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 130 [2020-11-07 04:48:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:36,138 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2020-11-07 04:48:36,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:48:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2020-11-07 04:48:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-11-07 04:48:36,144 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:36,144 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 10, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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 04:48:36,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:48:36,145 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 358934721, now seen corresponding path program 5 times [2020-11-07 04:48:36,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:36,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1760309738] [2020-11-07 04:48:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 04:48:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 290 proven. 130 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2020-11-07 04:48:36,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1760309738] [2020-11-07 04:48:36,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:36,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 04:48:36,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19340147] [2020-11-07 04:48:36,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 04:48:36,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 04:48:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-07 04:48:36,732 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand 16 states. [2020-11-07 04:48:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:39,212 INFO L93 Difference]: Finished difference Result 327 states and 576 transitions. [2020-11-07 04:48:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-11-07 04:48:39,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 187 [2020-11-07 04:48:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:39,218 INFO L225 Difference]: With dead ends: 327 [2020-11-07 04:48:39,219 INFO L226 Difference]: Without dead ends: 227 [2020-11-07 04:48:39,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=694, Invalid=2276, Unknown=0, NotChecked=0, Total=2970 [2020-11-07 04:48:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-11-07 04:48:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 166. [2020-11-07 04:48:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-11-07 04:48:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 232 transitions. [2020-11-07 04:48:39,291 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 232 transitions. Word has length 187 [2020-11-07 04:48:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:39,292 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 232 transitions. [2020-11-07 04:48:39,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 04:48:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 232 transitions. [2020-11-07 04:48:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-07 04:48:39,296 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:39,297 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 12, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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 04:48:39,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:48:39,297 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1590080201, now seen corresponding path program 6 times [2020-11-07 04:48:39,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:39,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495704223] [2020-11-07 04:48:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 04:48:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:39,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 188 proven. 423 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2020-11-07 04:48:40,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495704223] [2020-11-07 04:48:40,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:40,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 04:48:40,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635312454] [2020-11-07 04:48:40,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 04:48:40,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 04:48:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-11-07 04:48:40,006 INFO L87 Difference]: Start difference. First operand 166 states and 232 transitions. Second operand 17 states. [2020-11-07 04:48:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:42,794 INFO L93 Difference]: Finished difference Result 361 states and 564 transitions. [2020-11-07 04:48:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-11-07 04:48:42,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 225 [2020-11-07 04:48:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:42,801 INFO L225 Difference]: With dead ends: 361 [2020-11-07 04:48:42,801 INFO L226 Difference]: Without dead ends: 209 [2020-11-07 04:48:42,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=845, Invalid=2815, Unknown=0, NotChecked=0, Total=3660 [2020-11-07 04:48:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-11-07 04:48:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 162. [2020-11-07 04:48:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-07 04:48:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2020-11-07 04:48:42,854 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 225 [2020-11-07 04:48:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:42,855 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2020-11-07 04:48:42,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 04:48:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2020-11-07 04:48:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-11-07 04:48:42,859 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:42,860 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 13, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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 04:48:42,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 04:48:42,861 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1904198470, now seen corresponding path program 7 times [2020-11-07 04:48:42,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:42,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039049421] [2020-11-07 04:48:42,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:42,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 525 proven. 337 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2020-11-07 04:48:43,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039049421] [2020-11-07 04:48:43,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:43,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 04:48:43,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787178228] [2020-11-07 04:48:43,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 04:48:43,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 04:48:43,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2020-11-07 04:48:43,739 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand 23 states. [2020-11-07 04:48:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:48,893 INFO L93 Difference]: Finished difference Result 411 states and 644 transitions. [2020-11-07 04:48:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2020-11-07 04:48:48,898 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 244 [2020-11-07 04:48:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:48,910 INFO L225 Difference]: With dead ends: 411 [2020-11-07 04:48:48,910 INFO L226 Difference]: Without dead ends: 275 [2020-11-07 04:48:48,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1717, Invalid=7025, Unknown=0, NotChecked=0, Total=8742 [2020-11-07 04:48:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-11-07 04:48:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2020-11-07 04:48:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-07 04:48:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2020-11-07 04:48:48,974 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 276 transitions. Word has length 244 [2020-11-07 04:48:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:48,975 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 276 transitions. [2020-11-07 04:48:48,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 04:48:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 276 transitions. [2020-11-07 04:48:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-07 04:48:48,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:48,981 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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 04:48:48,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 04:48:48,981 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:48,982 INFO L82 PathProgramCache]: Analyzing trace with hash 198340805, now seen corresponding path program 8 times [2020-11-07 04:48:48,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:48,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684067840] [2020-11-07 04:48:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 04:48:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 588 proven. 448 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2020-11-07 04:48:49,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684067840] [2020-11-07 04:48:49,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:49,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 04:48:49,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167614922] [2020-11-07 04:48:49,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 04:48:49,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 04:48:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2020-11-07 04:48:49,961 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. Second operand 24 states. [2020-11-07 04:48:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:55,545 INFO L93 Difference]: Finished difference Result 483 states and 787 transitions. [2020-11-07 04:48:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-11-07 04:48:55,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 263 [2020-11-07 04:48:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:55,554 INFO L225 Difference]: With dead ends: 483 [2020-11-07 04:48:55,554 INFO L226 Difference]: Without dead ends: 311 [2020-11-07 04:48:55,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2913 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1985, Invalid=8317, Unknown=0, NotChecked=0, Total=10302 [2020-11-07 04:48:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-11-07 04:48:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 222. [2020-11-07 04:48:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-07 04:48:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2020-11-07 04:48:55,621 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 263 [2020-11-07 04:48:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:55,621 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2020-11-07 04:48:55,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 04:48:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2020-11-07 04:48:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-11-07 04:48:55,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:48:55,626 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 27, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 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 04:48:55,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 04:48:55,627 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:48:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:48:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2013349288, now seen corresponding path program 9 times [2020-11-07 04:48:55,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:48:55,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068755532] [2020-11-07 04:48:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:48:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:48:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:48:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 04:48:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 04:48:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:55,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 04:48:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 04:48:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 04:48:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 04:48:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 04:48:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 04:48:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:48:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 865 proven. 70 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2020-11-07 04:48:56,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068755532] [2020-11-07 04:48:56,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 04:48:56,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 04:48:56,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513498490] [2020-11-07 04:48:56,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 04:48:56,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:48:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 04:48:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2020-11-07 04:48:56,487 INFO L87 Difference]: Start difference. First operand 222 states and 318 transitions. Second operand 26 states. [2020-11-07 04:48:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:48:59,762 INFO L93 Difference]: Finished difference Result 310 states and 435 transitions. [2020-11-07 04:48:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-11-07 04:48:59,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 282 [2020-11-07 04:48:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:48:59,765 INFO L225 Difference]: With dead ends: 310 [2020-11-07 04:48:59,765 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 04:48:59,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1073, Invalid=4477, Unknown=0, NotChecked=0, Total=5550 [2020-11-07 04:48:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 04:48:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 04:48:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 04:48:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 04:48:59,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2020-11-07 04:48:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:48:59,772 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 04:48:59,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 04:48:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 04:48:59,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 04:48:59,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 04:48:59,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 04:49:02,930 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2020-11-07 04:49:03,478 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 69 [2020-11-07 04:49:03,903 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-11-07 04:49:04,079 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 78 [2020-11-07 04:49:04,309 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-11-07 04:49:04,540 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:04,702 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:04,972 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 99 [2020-11-07 04:49:05,268 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2020-11-07 04:49:05,479 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:05,658 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 115 [2020-11-07 04:49:05,784 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:06,021 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:06,157 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:06,452 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:06,614 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:07,174 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 69 [2020-11-07 04:49:07,449 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-11-07 04:49:07,558 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 78 [2020-11-07 04:49:07,758 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2020-11-07 04:49:07,988 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:08,126 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:08,375 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 99 [2020-11-07 04:49:08,658 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 127 [2020-11-07 04:49:08,856 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:09,031 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 115 [2020-11-07 04:49:09,158 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:09,362 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:09,490 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:09,778 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:09,947 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 116 [2020-11-07 04:49:10,570 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 93 [2020-11-07 04:49:10,857 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 136 [2020-11-07 04:49:11,009 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 113 [2020-11-07 04:49:11,204 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 136 [2020-11-07 04:49:11,427 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:11,576 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:11,840 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 104 [2020-11-07 04:49:12,176 WARN L194 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 149 [2020-11-07 04:49:12,381 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:12,602 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 143 [2020-11-07 04:49:12,741 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:12,947 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:13,083 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:13,388 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:13,561 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:14,158 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 93 [2020-11-07 04:49:14,434 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 136 [2020-11-07 04:49:14,582 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 113 [2020-11-07 04:49:14,778 WARN L194 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 136 [2020-11-07 04:49:15,001 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:15,144 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:15,416 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 104 [2020-11-07 04:49:15,738 WARN L194 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 149 [2020-11-07 04:49:15,945 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:16,167 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 143 [2020-11-07 04:49:16,303 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:16,515 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:16,651 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:16,956 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:17,138 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 115 [2020-11-07 04:49:19,814 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 12 [2020-11-07 04:49:20,053 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 21 [2020-11-07 04:49:20,292 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 21 [2020-11-07 04:49:20,643 WARN L194 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 24 [2020-11-07 04:49:20,787 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2020-11-07 04:49:22,391 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 130 DAG size of output: 47 [2020-11-07 04:49:22,505 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2020-11-07 04:49:24,403 WARN L194 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 227 DAG size of output: 42 [2020-11-07 04:49:26,314 WARN L194 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 227 DAG size of output: 42 [2020-11-07 04:49:28,845 WARN L194 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 268 DAG size of output: 53 [2020-11-07 04:49:31,384 WARN L194 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 268 DAG size of output: 53 [2020-11-07 04:49:33,690 WARN L194 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 181 DAG size of output: 56 [2020-11-07 04:49:33,986 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 9 [2020-11-07 04:49:35,195 WARN L194 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 120 DAG size of output: 43 [2020-11-07 04:49:36,543 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 130 DAG size of output: 47 [2020-11-07 04:49:36,550 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,551 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,551 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,551 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,551 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,551 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,551 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,552 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,552 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,552 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,552 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 04:49:36,552 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,552 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 04:49:36,552 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point L29(lines 29 33) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 27 47) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 27 47) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L262 CegarLoopResult]: At program point L42(lines 42 46) the Hoare annotation is: (or (<= 7 main_~result~0) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 04:49:36,553 INFO L269 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 27 47) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: false [2020-11-07 04:49:36,554 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: false [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-11-07 04:49:36,554 INFO L269 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-11-07 04:49:36,555 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (or (<= 7 |main_#t~ret12|) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-11-07 04:49:36,555 INFO L269 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-11-07 04:49:36,555 INFO L262 CegarLoopResult]: At program point L41-2(line 41) the Hoare annotation is: (or (<= 7 |main_#t~ret12|) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-11-07 04:49:36,555 INFO L262 CegarLoopResult]: At program point L41-3(line 41) the Hoare annotation is: (or (<= main_~m~0 1) (<= main_~n~0 1) (and (<= 7 |main_#t~ret12|) (<= 7 main_~result~0))) [2020-11-07 04:49:36,555 INFO L269 CegarLoopResult]: At program point L35(lines 35 40) the Hoare annotation is: true [2020-11-07 04:49:36,555 INFO L262 CegarLoopResult]: At program point ackermannEXIT(lines 16 24) the Hoare annotation is: (let ((.cse4 (<= 1 |ackermann_#in~m|))) (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse3 (<= 3 |ackermann_#res|)) (.cse1 (not .cse4)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse5 (= |ackermann_#in~m| 0))) (and (or (and (<= 2 |ackermann_#res|) .cse0) (<= 4 |ackermann_#res|) .cse1 (and .cse2 .cse3)) (or .cse4 .cse5) (let ((.cse6 (<= |ackermann_#in~m| 1)) (.cse7 (<= 5 |ackermann_#res|))) (or (<= 7 |ackermann_#res|) (and .cse6 (<= |ackermann_#in~n| 2)) (and .cse6 (<= |ackermann_#in~n| 3) .cse7) (and .cse6 (<= 6 |ackermann_#res|) (<= |ackermann_#in~n| 4)) (and .cse0 .cse3) .cse1 (and .cse2 (<= |ackermann_#in~m| 2) .cse7))) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse5)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)))) [2020-11-07 04:49:36,556 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-11-07 04:49:36,556 INFO L262 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse5 (<= |ackermann_#in~n| 2)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse7 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= |ackermann_#in~m| 2) .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse2 .cse3 .cse4) (and (<= |ackermann_#in~m| 1) .cse2 (<= 1 |ackermann_#in~m|) .cse3))) (or (= |ackermann_#in~n| 1) (and .cse6 (<= |ackermann_#in~n| 4)) (and .cse5 .cse1) .cse7 (and (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and (<= 2 |ackermann_#res|) .cse0)) (<= 2 |ackermann_#t~ret8|))) [2020-11-07 04:49:36,556 INFO L269 CegarLoopResult]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2020-11-07 04:49:36,556 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-11-07 04:49:36,557 INFO L262 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse5 (<= |ackermann_#in~n| 2)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse7 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= |ackermann_#in~m| 2) .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse2 .cse3 .cse4) (and (<= |ackermann_#in~m| 1) .cse2 (<= 1 |ackermann_#in~m|) .cse3))) (or (= |ackermann_#in~n| 1) (and .cse6 (<= |ackermann_#in~n| 4)) (and .cse5 .cse1) .cse7 (and (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and (<= 2 |ackermann_#res|) .cse0)) (<= 2 |ackermann_#t~ret8|))) [2020-11-07 04:49:36,557 INFO L262 CegarLoopResult]: At program point L20(lines 20 22) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-11-07 04:49:36,557 INFO L262 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (let ((.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret7|)) (and (<= |ackermann_#in~m| 1) .cse0 (<= 2 |ackermann_#t~ret7|) (<= 1 |ackermann_#in~m|) .cse1)))) [2020-11-07 04:49:36,557 INFO L262 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse3 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 2)) (.cse7 (<= |ackermann_#in~m| 2)) (.cse4 (<= 7 |ackermann_#t~ret9|)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse6 (<= |ackermann_#in~n| 1)) (.cse2 (<= 5 |ackermann_#t~ret9|)) (.cse1 (<= 3 |ackermann_#t~ret8|))) (and (or (= |ackermann_#in~n| 1) (and .cse0 .cse1) (and .cse2 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and .cse3 .cse4) (and (<= 6 |ackermann_#t~ret9|) .cse5 (<= |ackermann_#in~n| 4)) (and (<= 2 |ackermann_#res|) .cse6)) (or .cse7 .cse4) (let ((.cse9 (<= |ackermann_#in~m| 1)) (.cse10 (<= 1 |ackermann_#in~m|)) (.cse8 (<= 2 |ackermann_#in~m|))) (or (and .cse3 .cse4 .cse8) (and .cse6 .cse9 (<= 2 |ackermann_#t~ret8|) (<= 3 |ackermann_#t~ret9|) .cse10) (and .cse9 (<= 4 |ackermann_#t~ret9|) .cse1 .cse10) (and .cse0 .cse7 .cse4 .cse5 .cse8) (and .cse6 .cse2 .cse1 .cse8))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|))) [2020-11-07 04:49:36,558 INFO L262 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (let ((.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret7|)) (and (<= |ackermann_#in~m| 1) .cse0 (<= 2 |ackermann_#t~ret7|) (<= 1 |ackermann_#in~m|) .cse1)))) [2020-11-07 04:49:36,558 INFO L262 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse3 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 2)) (.cse7 (<= |ackermann_#in~m| 2)) (.cse4 (<= 7 |ackermann_#t~ret9|)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse6 (<= |ackermann_#in~n| 1)) (.cse2 (<= 5 |ackermann_#t~ret9|)) (.cse1 (<= 3 |ackermann_#t~ret8|))) (and (or (= |ackermann_#in~n| 1) (and .cse0 .cse1) (and .cse2 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and .cse3 .cse4) (and (<= 6 |ackermann_#t~ret9|) .cse5 (<= |ackermann_#in~n| 4)) (and (<= 2 |ackermann_#res|) .cse6)) (or .cse7 .cse4) (let ((.cse9 (<= |ackermann_#in~m| 1)) (.cse10 (<= 1 |ackermann_#in~m|)) (.cse8 (<= 2 |ackermann_#in~m|))) (or (and .cse3 .cse4 .cse8) (and .cse6 .cse9 (<= 2 |ackermann_#t~ret8|) (<= 3 |ackermann_#t~ret9|) .cse10) (and .cse9 (<= 4 |ackermann_#t~ret9|) .cse1 .cse10) (and .cse0 .cse7 .cse4 .cse5 .cse8) (and .cse6 .cse2 .cse1 .cse8))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|))) [2020-11-07 04:49:36,558 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= |ackermann_#in~m| 0)) [2020-11-07 04:49:36,558 INFO L262 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (or (and (<= 3 |ackermann_#res|) (<= 3 |ackermann_#t~ret7|)) (and (<= 2 |ackermann_#res|) (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret7|))) (= |ackermann_#in~n| 0) (<= 1 |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 04:49:36,559 INFO L262 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1)) (.cse4 (<= |ackermann_#in~n| 2)) (.cse2 (<= 6 |ackermann_#t~ret8|)) (.cse13 (<= 5 |ackermann_#t~ret9|)) (.cse5 (<= |ackermann_#in~m| 2)) (.cse14 (<= 5 |ackermann_#res|)) (.cse7 (<= |ackermann_#in~m| 1)) (.cse1 (<= 7 |ackermann_#res|)) (.cse3 (<= 7 |ackermann_#t~ret9|)) (.cse12 (<= 3 |ackermann_#t~ret8|))) (and (or .cse0 (and .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 .cse5 .cse6) (and .cse7 (<= 4 |ackermann_#res|) (<= 4 |ackermann_#t~ret9|))) (let ((.cse10 (<= 3 |ackermann_#t~ret9|)) (.cse11 (<= 3 |ackermann_#res|)) (.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= 6 |ackermann_#t~ret9|) (<= 6 |ackermann_#res|) .cse6 .cse8 .cse9 (<= |ackermann_#in~n| 4)) (and .cse0 (<= 2 |ackermann_#t~ret8|) .cse10 .cse11 .cse8 .cse9) (and .cse4 .cse12 .cse10 .cse11 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse13 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|) .cse14 .cse8 .cse9))) (let ((.cse15 (<= 2 |ackermann_#in~m|))) (or (and .cse13 .cse5 .cse12 .cse14 .cse15) (and .cse7 (<= 1 |ackermann_#in~m|)) (and .cse1 .cse3 .cse12 .cse15))))) [2020-11-07 04:49:36,559 INFO L262 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 04:49:36,559 INFO L262 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (<= 7 |ackermann_#res|)) (.cse1 (<= 7 |ackermann_#t~ret9|)) (.cse2 (<= |ackermann_#in~m| 1)) (.cse3 (<= 5 |ackermann_#t~ret9|)) (.cse4 (<= 5 |ackermann_#res|))) (and (or (<= |ackermann_#in~n| 1) (and .cse0 .cse1) (and .cse2 (<= 6 |ackermann_#t~ret9|) (<= 6 |ackermann_#res|) (<= |ackermann_#in~n| 4)) (and .cse2 (<= 4 |ackermann_#res|) (<= |ackermann_#in~n| 2) (<= 4 |ackermann_#t~ret9|)) (and .cse3 .cse2 (<= |ackermann_#in~n| 3) .cse4)) (let ((.cse5 (= ackermann_~n |ackermann_#in~n|)) (.cse6 (= ackermann_~m |ackermann_#in~m|)) (.cse7 (<= 2 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse2 (<= 3 |ackermann_#t~ret9|) (<= 3 |ackermann_#res|) .cse5 (<= 1 |ackermann_#in~m|) .cse6) (and .cse3 (<= |ackermann_#in~m| 2) .cse4 .cse5 .cse6 .cse7))))) [2020-11-07 04:49:36,559 INFO L262 CegarLoopResult]: At program point L16(lines 16 24) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-11-07 04:49:36,560 INFO L262 CegarLoopResult]: At program point ackermannFINAL(lines 16 24) the Hoare annotation is: (let ((.cse4 (<= 1 |ackermann_#in~m|))) (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse3 (<= 3 |ackermann_#res|)) (.cse1 (not .cse4)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse5 (= |ackermann_#in~m| 0))) (and (or (and (<= 2 |ackermann_#res|) .cse0) (<= 4 |ackermann_#res|) .cse1 (and .cse2 .cse3)) (or .cse4 .cse5) (let ((.cse6 (<= |ackermann_#in~m| 1)) (.cse7 (<= 5 |ackermann_#res|))) (or (<= 7 |ackermann_#res|) (and .cse6 (<= |ackermann_#in~n| 2)) (and .cse6 (<= |ackermann_#in~n| 3) .cse7) (and .cse6 (<= 6 |ackermann_#res|) (<= |ackermann_#in~n| 4)) (and .cse0 .cse3) .cse1 (and .cse2 (<= |ackermann_#in~m| 2) .cse7))) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse5)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)))) [2020-11-07 04:49:36,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:49:36 BoogieIcfgContainer [2020-11-07 04:49:36,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 04:49:36,584 INFO L168 Benchmark]: Toolchain (without parser) took 68238.15 ms. Allocated memory was 168.8 MB in the beginning and 610.3 MB in the end (delta: 441.5 MB). Free memory was 145.6 MB in the beginning and 516.4 MB in the end (delta: -370.8 MB). Peak memory consumption was 373.3 MB. Max. memory is 8.0 GB. [2020-11-07 04:49:36,585 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory was 98.4 MB in the beginning and 98.3 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 04:49:36,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.93 ms. Allocated memory is still 168.8 MB. Free memory was 144.9 MB in the beginning and 135.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:49:36,586 INFO L168 Benchmark]: Boogie Preprocessor took 34.45 ms. Allocated memory is still 168.8 MB. Free memory was 135.8 MB in the beginning and 134.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 04:49:36,586 INFO L168 Benchmark]: RCFGBuilder took 363.58 ms. Allocated memory is still 168.8 MB. Free memory was 134.3 MB in the beginning and 144.4 MB in the end (delta: -10.1 MB). Peak memory consumption was 10.8 MB. Max. memory is 8.0 GB. [2020-11-07 04:49:36,587 INFO L168 Benchmark]: TraceAbstraction took 67587.73 ms. Allocated memory was 168.8 MB in the beginning and 610.3 MB in the end (delta: 441.5 MB). Free memory was 144.0 MB in the beginning and 516.4 MB in the end (delta: -372.4 MB). Peak memory consumption was 370.9 MB. Max. memory is 8.0 GB. [2020-11-07 04:49:36,589 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 98.4 MB in the beginning and 98.3 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 240.93 ms. Allocated memory is still 168.8 MB. Free memory was 144.9 MB in the beginning and 135.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.45 ms. Allocated memory is still 168.8 MB. Free memory was 135.8 MB in the beginning and 134.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 363.58 ms. Allocated memory is still 168.8 MB. Free memory was 134.3 MB in the beginning and 144.4 MB in the end (delta: -10.1 MB). Peak memory consumption was 10.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 67587.73 ms. Allocated memory was 168.8 MB in the beginning and 610.3 MB in the end (delta: 441.5 MB). Free memory was 144.0 MB in the beginning and 516.4 MB in the end (delta: -372.4 MB). Peak memory consumption was 370.9 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: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann: ((((((((2 <= \result && \old(n) == 0) || 4 <= \result) || !(1 <= \old(m))) || (\old(n) <= 1 && 3 <= \result)) && (1 <= \old(m) || \old(m) == 0)) && ((((((7 <= \result || (\old(m) <= 1 && \old(n) <= 2)) || ((\old(m) <= 1 && \old(n) <= 3) && 5 <= \result)) || ((\old(m) <= 1 && 6 <= \result) && \old(n) <= 4)) || (\old(n) == 0 && 3 <= \result)) || !(1 <= \old(m))) || ((\old(n) <= 1 && \old(m) <= 2) && 5 <= \result))) && (\old(n) + 1 <= \result || !(\old(m) == 0))) && n == \old(n)) && m == \old(m) - ProcedureContractResult [Line: 27]: 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: 30.6s, OverallIterations: 11, TraceHistogramMax: 27, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 602 SDtfs, 1344 SDslu, 1050 SDs, 0 SdLazy, 5924 SolverSat, 1245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 876 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8262 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 314 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 2706 PreInvPairs, 8853 NumberOfFragments, 1195 HoareAnnotationTreeSize, 2706 FomulaSimplifications, 9580823 FormulaSimplificationTreeSizeReduction, 19.7s HoareSimplificationTime, 56 FomulaSimplificationsInter, 959768 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1738 NumberOfCodeBlocks, 1738 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1727 ConstructedInterpolants, 0 QuantifiedInterpolants, 685015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 7763/9583 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...