/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:25:29,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:25:29,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:25:29,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:25:29,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:25:29,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:25:29,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:25:29,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:25:29,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:25:29,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:25:29,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:25:29,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:25:29,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:25:29,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:25:29,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:25:29,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:25:29,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:25:29,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:25:29,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:25:29,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:25:29,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:25:29,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:25:29,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:25:29,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:25:29,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:25:29,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:25:29,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:25:29,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:25:29,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:25:29,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:25:29,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:25:29,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:25:29,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:25:29,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:25:29,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:25:29,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:25:29,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:25:29,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:25:29,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:25:29,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:25:29,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:25:29,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:25:29,954 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:25:29,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:25:29,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:25:29,956 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:25:29,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:25:29,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:25:29,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:25:29,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:25:29,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:25:29,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:25:29,958 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:25:29,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:25:29,958 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:25:29,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:25:29,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:25:29,959 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:25:29,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:25:29,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:25:29,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:29,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:25:29,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:25:29,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:25:29,960 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:25:30,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:25:30,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:25:30,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:25:30,358 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:25:30,359 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:25:30,360 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 00:25:30,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5cb6a2d/e130f9039ccc4f849cf466912e3943ba/FLAG2b0dfd21d [2020-11-07 00:25:31,020 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:25:31,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann04.c [2020-11-07 00:25:31,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5cb6a2d/e130f9039ccc4f849cf466912e3943ba/FLAG2b0dfd21d [2020-11-07 00:25:31,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b5cb6a2d/e130f9039ccc4f849cf466912e3943ba [2020-11-07 00:25:31,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:25:31,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:25:31,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:31,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:25:31,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:25:31,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a09edc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31, skipping insertion in model container [2020-11-07 00:25:31,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:25:31,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:25:31,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:31,581 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:25:31,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:25:31,616 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:25:31,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31 WrapperNode [2020-11-07 00:25:31,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:25:31,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:25:31,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:25:31,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:25:31,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... [2020-11-07 00:25:31,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:25:31,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:25:31,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:25:31,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:25:31,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:25:31,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:25:31,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:25:31,783 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:25:31,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-11-07 00:25:31,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:25:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:25:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:25:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:25:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:25:31,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:25:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-11-07 00:25:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:25:31,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:25:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:25:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:25:31,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:25:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:25:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:25:32,303 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:25:32,303 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:25:32,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:32 BoogieIcfgContainer [2020-11-07 00:25:32,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:25:32,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:25:32,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:25:32,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:25:32,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:25:31" (1/3) ... [2020-11-07 00:25:32,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fea1273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:32, skipping insertion in model container [2020-11-07 00:25:32,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:25:31" (2/3) ... [2020-11-07 00:25:32,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fea1273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:25:32, skipping insertion in model container [2020-11-07 00:25:32,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:25:32" (3/3) ... [2020-11-07 00:25:32,323 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2020-11-07 00:25:32,340 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:25:32,344 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:25:32,359 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:25:32,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:25:32,393 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:25:32,394 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:25:32,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:25:32,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:25:32,394 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:25:32,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:25:32,394 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:25:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-11-07 00:25:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:25:32,430 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:32,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:32,431 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash -946996355, now seen corresponding path program 1 times [2020-11-07 00:25:32,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:32,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560098437] [2020-11-07 00:25:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:32,549 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:25:32,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560098437] [2020-11-07 00:25:32,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:32,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:32,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824396856] [2020-11-07 00:25:32,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:32,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:32,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:32,930 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 6 states. [2020-11-07 00:25:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:33,424 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2020-11-07 00:25:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:33,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-11-07 00:25:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:33,438 INFO L225 Difference]: With dead ends: 101 [2020-11-07 00:25:33,438 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:25:33,443 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 00:25:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:25:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:25:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:25:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2020-11-07 00:25:33,505 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 33 [2020-11-07 00:25:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:33,505 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2020-11-07 00:25:33,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-11-07 00:25:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:25:33,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:33,509 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:33,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:25:33,510 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:33,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 300807360, now seen corresponding path program 1 times [2020-11-07 00:25:33,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:33,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888997467] [2020-11-07 00:25:33,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:33,515 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:33,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:33,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:33,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:25:33,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888997467] [2020-11-07 00:25:33,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:33,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:25:33,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958472498] [2020-11-07 00:25:33,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:25:33,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:25:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:25:33,655 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2020-11-07 00:25:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:34,002 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2020-11-07 00:25:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:25:34,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-07 00:25:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:34,006 INFO L225 Difference]: With dead ends: 93 [2020-11-07 00:25:34,006 INFO L226 Difference]: Without dead ends: 56 [2020-11-07 00:25:34,013 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 00:25:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-07 00:25:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-07 00:25:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 00:25:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-11-07 00:25:34,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 43 [2020-11-07 00:25:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:34,049 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-11-07 00:25:34,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:25:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-11-07 00:25:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 00:25:34,059 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:34,059 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:25:34,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:25:34,060 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1772464485, now seen corresponding path program 1 times [2020-11-07 00:25:34,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:34,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455033089] [2020-11-07 00:25:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:34,076 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 00:25:34,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455033089] [2020-11-07 00:25:34,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:34,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:34,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310495640] [2020-11-07 00:25:34,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:34,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:34,262 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 7 states. [2020-11-07 00:25:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:34,693 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2020-11-07 00:25:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:34,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-11-07 00:25:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:34,699 INFO L225 Difference]: With dead ends: 85 [2020-11-07 00:25:34,700 INFO L226 Difference]: Without dead ends: 78 [2020-11-07 00:25:34,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:25:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-07 00:25:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-11-07 00:25:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-07 00:25:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2020-11-07 00:25:34,744 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 62 [2020-11-07 00:25:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:34,744 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2020-11-07 00:25:34,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2020-11-07 00:25:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:25:34,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:34,748 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 00:25:34,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:25:34,749 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:34,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1545390750, now seen corresponding path program 2 times [2020-11-07 00:25:34,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:34,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075743761] [2020-11-07 00:25:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:34,753 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-07 00:25:34,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075743761] [2020-11-07 00:25:34,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:34,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:25:34,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600776496] [2020-11-07 00:25:34,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:25:34,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:25:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:25:34,949 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 7 states. [2020-11-07 00:25:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:35,421 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2020-11-07 00:25:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:25:35,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-11-07 00:25:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:35,426 INFO L225 Difference]: With dead ends: 117 [2020-11-07 00:25:35,427 INFO L226 Difference]: Without dead ends: 110 [2020-11-07 00:25:35,428 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 00:25:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-07 00:25:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-07 00:25:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-07 00:25:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2020-11-07 00:25:35,464 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 81 [2020-11-07 00:25:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:35,464 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2020-11-07 00:25:35,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:25:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2020-11-07 00:25:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-11-07 00:25:35,474 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:35,474 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 00:25:35,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:25:35,475 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1932765146, now seen corresponding path program 3 times [2020-11-07 00:25:35,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:35,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1298950465] [2020-11-07 00:25:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:35,480 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 00:25:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:35,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 36 proven. 107 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2020-11-07 00:25:36,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1298950465] [2020-11-07 00:25:36,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:36,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:25:36,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6703253] [2020-11-07 00:25:36,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:25:36,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:36,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:25:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:25:36,099 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand 10 states. [2020-11-07 00:25:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:37,379 INFO L93 Difference]: Finished difference Result 230 states and 451 transitions. [2020-11-07 00:25:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:25:37,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2020-11-07 00:25:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:37,387 INFO L225 Difference]: With dead ends: 230 [2020-11-07 00:25:37,387 INFO L226 Difference]: Without dead ends: 126 [2020-11-07 00:25:37,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:25:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-07 00:25:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2020-11-07 00:25:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 00:25:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2020-11-07 00:25:37,460 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 188 [2020-11-07 00:25:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:37,461 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2020-11-07 00:25:37,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:25:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2020-11-07 00:25:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-07 00:25:37,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:37,466 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 00:25:37,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:25:37,467 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1837059662, now seen corresponding path program 4 times [2020-11-07 00:25:37,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:37,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145333984] [2020-11-07 00:25:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:37,475 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-07 00:25:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-11-07 00:25:37,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145333984] [2020-11-07 00:25:37,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:37,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:25:37,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185571789] [2020-11-07 00:25:37,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:25:37,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:25:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:25:37,947 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand 16 states. [2020-11-07 00:25:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:39,935 INFO L93 Difference]: Finished difference Result 265 states and 440 transitions. [2020-11-07 00:25:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 00:25:39,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 130 [2020-11-07 00:25:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:39,945 INFO L225 Difference]: With dead ends: 265 [2020-11-07 00:25:39,946 INFO L226 Difference]: Without dead ends: 165 [2020-11-07 00:25:39,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=397, Invalid=1325, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 00:25:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-07 00:25:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2020-11-07 00:25:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 00:25:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2020-11-07 00:25:40,024 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 130 [2020-11-07 00:25:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:40,026 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2020-11-07 00:25:40,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:25:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2020-11-07 00:25:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-11-07 00:25:40,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:40,030 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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 00:25:40,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:25:40,031 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:40,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:40,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1924315322, now seen corresponding path program 5 times [2020-11-07 00:25:40,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:40,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517417971] [2020-11-07 00:25:40,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:40,040 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 00:25:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 00:25:40,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517417971] [2020-11-07 00:25:40,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:40,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:25:40,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133516665] [2020-11-07 00:25:40,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:25:40,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:25:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:40,668 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand 17 states. [2020-11-07 00:25:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:43,693 INFO L93 Difference]: Finished difference Result 282 states and 452 transitions. [2020-11-07 00:25:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-11-07 00:25:43,694 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2020-11-07 00:25:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:43,699 INFO L225 Difference]: With dead ends: 282 [2020-11-07 00:25:43,699 INFO L226 Difference]: Without dead ends: 182 [2020-11-07 00:25:43,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=705, Invalid=2265, Unknown=0, NotChecked=0, Total=2970 [2020-11-07 00:25:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-11-07 00:25:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 138. [2020-11-07 00:25:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-07 00:25:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2020-11-07 00:25:43,740 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 168 [2020-11-07 00:25:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:43,740 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2020-11-07 00:25:43,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:25:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2020-11-07 00:25:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2020-11-07 00:25:43,744 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:43,744 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 11, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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 00:25:43,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:25:43,745 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1273104622, now seen corresponding path program 6 times [2020-11-07 00:25:43,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:43,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [250043025] [2020-11-07 00:25:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:43,749 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:43,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-11-07 00:25:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 82 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-11-07 00:25:44,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [250043025] [2020-11-07 00:25:44,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:44,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:25:44,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941532542] [2020-11-07 00:25:44,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:25:44,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:25:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:25:44,272 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand 17 states. [2020-11-07 00:25:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:47,744 INFO L93 Difference]: Finished difference Result 330 states and 517 transitions. [2020-11-07 00:25:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-11-07 00:25:47,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2020-11-07 00:25:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:47,750 INFO L225 Difference]: With dead ends: 330 [2020-11-07 00:25:47,750 INFO L226 Difference]: Without dead ends: 206 [2020-11-07 00:25:47,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=889, Invalid=2893, Unknown=0, NotChecked=0, Total=3782 [2020-11-07 00:25:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-11-07 00:25:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 162. [2020-11-07 00:25:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-07 00:25:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2020-11-07 00:25:47,801 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 206 [2020-11-07 00:25:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:47,802 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2020-11-07 00:25:47,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:25:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2020-11-07 00:25:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-11-07 00:25:47,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:47,807 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 00:25:47,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:25:47,808 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1904198470, now seen corresponding path program 7 times [2020-11-07 00:25:47,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:47,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174943527] [2020-11-07 00:25:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:47,814 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:47,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 00:25:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 00:25:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 00:25:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 67 proven. 69 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-11-07 00:25:48,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174943527] [2020-11-07 00:25:48,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:48,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:25:48,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51914075] [2020-11-07 00:25:48,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:25:48,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:48,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:25:48,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:25:48,780 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand 23 states. [2020-11-07 00:25:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:25:54,972 INFO L93 Difference]: Finished difference Result 414 states and 647 transitions. [2020-11-07 00:25:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2020-11-07 00:25:54,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 244 [2020-11-07 00:25:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:25:54,982 INFO L225 Difference]: With dead ends: 414 [2020-11-07 00:25:54,983 INFO L226 Difference]: Without dead ends: 278 [2020-11-07 00:25:54,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1868, Invalid=7444, Unknown=0, NotChecked=0, Total=9312 [2020-11-07 00:25:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-11-07 00:25:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 198. [2020-11-07 00:25:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-07 00:25:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 276 transitions. [2020-11-07 00:25:55,044 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 276 transitions. Word has length 244 [2020-11-07 00:25:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:25:55,045 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 276 transitions. [2020-11-07 00:25:55,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:25:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 276 transitions. [2020-11-07 00:25:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-11-07 00:25:55,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:25:55,055 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 00:25:55,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:25:55,056 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:25:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:25:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 198340805, now seen corresponding path program 8 times [2020-11-07 00:25:55,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:25:55,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600686155] [2020-11-07 00:25:55,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:25:55,061 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:25:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:25:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:25:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:25:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 00:25:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 00:25:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:25:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:25:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:25:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 00:25:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:55,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 00:25:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:25:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 75 proven. 81 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2020-11-07 00:25:56,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600686155] [2020-11-07 00:25:56,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:25:56,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:25:56,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591705631] [2020-11-07 00:25:56,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:25:56,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:25:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:25:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:25:56,015 INFO L87 Difference]: Start difference. First operand 198 states and 276 transitions. Second operand 24 states. [2020-11-07 00:26:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:02,874 INFO L93 Difference]: Finished difference Result 486 states and 790 transitions. [2020-11-07 00:26:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2020-11-07 00:26:02,875 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 263 [2020-11-07 00:26:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:02,882 INFO L225 Difference]: With dead ends: 486 [2020-11-07 00:26:02,882 INFO L226 Difference]: Without dead ends: 314 [2020-11-07 00:26:02,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2150, Invalid=8770, Unknown=0, NotChecked=0, Total=10920 [2020-11-07 00:26:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-11-07 00:26:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 222. [2020-11-07 00:26:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-07 00:26:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2020-11-07 00:26:02,959 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 263 [2020-11-07 00:26:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:02,960 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2020-11-07 00:26:02,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:26:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2020-11-07 00:26:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2020-11-07 00:26:02,967 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:02,967 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 00:26:02,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:26:02,968 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2013349288, now seen corresponding path program 9 times [2020-11-07 00:26:02,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:02,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1252761759] [2020-11-07 00:26:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:02,972 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 00:26:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:26:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 00:26:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:26:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:26:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 00:26:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-11-07 00:26:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 00:26:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 00:26:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 00:26:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 00:26:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 00:26:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-07 00:26:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2020-11-07 00:26:03,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1252761759] [2020-11-07 00:26:03,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:03,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-11-07 00:26:03,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533338487] [2020-11-07 00:26:03,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 00:26:03,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:03,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 00:26:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:26:03,832 INFO L87 Difference]: Start difference. First operand 222 states and 318 transitions. Second operand 26 states. [2020-11-07 00:26:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:07,890 INFO L93 Difference]: Finished difference Result 314 states and 439 transitions. [2020-11-07 00:26:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-11-07 00:26:07,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 282 [2020-11-07 00:26:07,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:07,893 INFO L225 Difference]: With dead ends: 314 [2020-11-07 00:26:07,893 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:26:07,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1215, Invalid=4947, Unknown=0, NotChecked=0, Total=6162 [2020-11-07 00:26:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:26:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:26:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:26:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:26:07,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2020-11-07 00:26:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:07,901 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:26:07,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 00:26:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:26:07,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:26:07,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:26:07,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:26:11,738 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:11,968 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:12,231 WARN L194 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 90 [2020-11-07 00:26:12,618 WARN L194 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 120 [2020-11-07 00:26:12,872 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 123 [2020-11-07 00:26:13,117 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:13,289 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:13,489 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:13,627 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:13,916 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:14,046 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:14,455 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 68 [2020-11-07 00:26:14,670 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-11-07 00:26:14,803 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2020-11-07 00:26:15,130 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-11-07 00:26:15,503 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:15,621 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:15,774 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 90 [2020-11-07 00:26:16,020 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 120 [2020-11-07 00:26:16,229 WARN L194 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 123 [2020-11-07 00:26:16,370 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:16,526 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:16,728 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:16,859 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:17,146 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:17,275 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 100 [2020-11-07 00:26:17,636 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 68 [2020-11-07 00:26:17,885 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-11-07 00:26:17,996 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2020-11-07 00:26:18,230 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-11-07 00:26:18,594 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:18,720 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:18,865 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 95 [2020-11-07 00:26:19,155 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 139 [2020-11-07 00:26:19,415 WARN L194 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 135 [2020-11-07 00:26:19,564 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:19,733 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:19,977 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:20,108 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:20,405 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:20,547 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:20,968 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 107 [2020-11-07 00:26:21,197 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-11-07 00:26:21,344 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 106 [2020-11-07 00:26:21,606 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-11-07 00:26:21,970 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:22,097 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:22,243 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 95 [2020-11-07 00:26:22,519 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 139 [2020-11-07 00:26:22,775 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 135 [2020-11-07 00:26:22,924 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:23,102 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:23,308 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:23,441 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:23,733 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:23,889 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2020-11-07 00:26:24,319 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 107 [2020-11-07 00:26:24,555 WARN L194 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-11-07 00:26:24,701 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 106 [2020-11-07 00:26:24,970 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-11-07 00:26:27,830 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 12 [2020-11-07 00:26:28,133 WARN L194 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2020-11-07 00:26:28,426 WARN L194 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 21 [2020-11-07 00:26:28,841 WARN L194 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 25 [2020-11-07 00:26:29,001 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2020-11-07 00:26:30,988 WARN L194 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 130 DAG size of output: 47 [2020-11-07 00:26:31,134 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2020-11-07 00:26:33,051 WARN L194 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 188 DAG size of output: 41 [2020-11-07 00:26:34,956 WARN L194 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 188 DAG size of output: 41 [2020-11-07 00:26:37,757 WARN L194 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 251 DAG size of output: 56 [2020-11-07 00:26:40,556 WARN L194 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 251 DAG size of output: 56 [2020-11-07 00:26:42,886 WARN L194 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 148 DAG size of output: 60 [2020-11-07 00:26:43,243 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 9 [2020-11-07 00:26:45,356 WARN L194 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 155 DAG size of output: 49 [2020-11-07 00:26:46,988 WARN L194 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 130 DAG size of output: 47 [2020-11-07 00:26:46,996 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,996 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,996 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,997 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:26:46,998 INFO L269 CegarLoopResult]: At program point L29(lines 29 33) the Hoare annotation is: true [2020-11-07 00:26:46,999 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 27 47) the Hoare annotation is: true [2020-11-07 00:26:46,999 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 27 47) the Hoare annotation is: true [2020-11-07 00:26:46,999 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 00:26:46,999 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-07 00:26:46,999 INFO L269 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-11-07 00:26:46,999 INFO L269 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-11-07 00:26:46,999 INFO L269 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-11-07 00:26:46,999 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 27 47) the Hoare annotation is: true [2020-11-07 00:26:47,000 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 00:26:47,000 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 00:26:47,000 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: false [2020-11-07 00:26:47,000 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: false [2020-11-07 00:26:47,000 INFO L269 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-11-07 00:26:47,000 INFO L269 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-11-07 00:26:47,000 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 00:26:47,000 INFO L269 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-11-07 00:26:47,000 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 00:26:47,000 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 00:26:47,001 INFO L269 CegarLoopResult]: At program point L35(lines 35 40) the Hoare annotation is: true [2020-11-07 00:26:47,001 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 00:26:47,001 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 00:26:47,001 INFO L262 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse5 (<= |ackermann_#in~n| 2)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse7 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= |ackermann_#in~m| 2) .cse6 .cse3 .cse2 .cse4) (and .cse7 .cse3 .cse2 .cse4) (and (<= |ackermann_#in~m| 1) .cse3 (<= 1 |ackermann_#in~m|) .cse2))) (<= 2 |ackermann_#t~ret8|) (or (= |ackermann_#in~n| 1) (and .cse5 .cse1) (and .cse6 (<= |ackermann_#in~n| 4)) .cse7 (and (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and (<= 2 |ackermann_#res|) .cse0)))) [2020-11-07 00:26:47,001 INFO L269 CegarLoopResult]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2020-11-07 00:26:47,001 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 00:26:47,001 INFO L262 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse5 (<= |ackermann_#in~n| 2)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse6 (<= 5 |ackermann_#t~ret8|)) (.cse7 (<= 6 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1))) (and (let ((.cse4 (<= 2 |ackermann_#in~m|)) (.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= |ackermann_#in~m| 2) .cse6 .cse3 .cse2 .cse4) (and .cse7 .cse3 .cse2 .cse4) (and (<= |ackermann_#in~m| 1) .cse3 (<= 1 |ackermann_#in~m|) .cse2))) (<= 2 |ackermann_#t~ret8|) (or (= |ackermann_#in~n| 1) (and .cse5 .cse1) (and .cse6 (<= |ackermann_#in~n| 4)) .cse7 (and (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|)) (and (<= 2 |ackermann_#res|) .cse0)))) [2020-11-07 00:26:47,002 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 00:26:47,002 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 00:26:47,002 INFO L262 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse2 (<= 5 |ackermann_#t~ret9|)) (.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 2)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse3 (<= 6 |ackermann_#t~ret8|)) (.cse4 (<= 7 |ackermann_#t~ret9|))) (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 (and .cse6 (<= 2 |ackermann_#t~ret8|) (<= 3 |ackermann_#t~ret9|)) (and (<= 4 |ackermann_#t~ret9|) .cse1)) (let ((.cse7 (<= |ackermann_#in~m| 2)) (.cse10 (<= 2 |ackermann_#in~m|)) (.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse6 .cse2 .cse7 .cse1 .cse8 .cse9 .cse10) (and .cse6 .cse4 .cse1 .cse9 .cse8 .cse10) (and .cse0 .cse7 .cse4 .cse5 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse8 .cse9 .cse10) (and (<= |ackermann_#in~m| 1) .cse8 (<= 1 |ackermann_#in~m|) .cse9))))) [2020-11-07 00:26:47,002 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 00:26:47,002 INFO L262 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse2 (<= 5 |ackermann_#t~ret9|)) (.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= 3 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 2)) (.cse5 (<= 5 |ackermann_#t~ret8|)) (.cse3 (<= 6 |ackermann_#t~ret8|)) (.cse4 (<= 7 |ackermann_#t~ret9|))) (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 (and .cse6 (<= 2 |ackermann_#t~ret8|) (<= 3 |ackermann_#t~ret9|)) (and (<= 4 |ackermann_#t~ret9|) .cse1)) (let ((.cse7 (<= |ackermann_#in~m| 2)) (.cse10 (<= 2 |ackermann_#in~m|)) (.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse6 .cse2 .cse7 .cse1 .cse8 .cse9 .cse10) (and .cse6 .cse4 .cse1 .cse9 .cse8 .cse10) (and .cse0 .cse7 .cse4 .cse5 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse8 .cse9 .cse10) (and (<= |ackermann_#in~m| 1) .cse8 (<= 1 |ackermann_#in~m|) .cse9))))) [2020-11-07 00:26:47,003 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 00:26:47,003 INFO L262 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (or (and (<= 3 |ackermann_#res|) (<= 2 |ackermann_#in~m|) (<= 3 |ackermann_#t~ret7|)) (and (<= 2 |ackermann_#res|) (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret7|) (<= 1 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-11-07 00:26:47,003 INFO L262 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse5 (<= 6 |ackermann_#t~ret8|)) (.cse9 (<= 5 |ackermann_#t~ret8|)) (.cse7 (<= |ackermann_#in~n| 2)) (.cse14 (<= 3 |ackermann_#t~ret8|)) (.cse0 (<= |ackermann_#in~n| 1)) (.cse3 (<= |ackermann_#in~m| 1)) (.cse4 (<= 7 |ackermann_#res|)) (.cse6 (<= 7 |ackermann_#t~ret9|)) (.cse12 (<= 5 |ackermann_#t~ret9|)) (.cse8 (<= |ackermann_#in~m| 2)) (.cse13 (<= 5 |ackermann_#res|))) (and (let ((.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse7 .cse6 .cse8 .cse9 .cse1 .cse2))) (let ((.cse10 (<= 3 |ackermann_#t~ret9|)) (.cse11 (<= 3 |ackermann_#res|))) (or (and .cse0 (<= 2 |ackermann_#t~ret8|) .cse10 .cse11) (and .cse12 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|) .cse13) (and .cse4 .cse5 .cse6) (and (<= 6 |ackermann_#t~ret9|) (<= 6 |ackermann_#res|) .cse9 (<= |ackermann_#in~n| 4)) (and .cse7 .cse14 .cse10 .cse11))) (or (and .cse3 (<= 1 |ackermann_#in~m|)) (and .cse14 (<= 2 |ackermann_#in~m|))) (or .cse0 (and (<= 4 |ackermann_#res|) (<= 4 |ackermann_#t~ret9|))) (or .cse3 (and .cse4 .cse6) (and .cse12 .cse8 .cse13)))) [2020-11-07 00:26:47,003 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 00:26:47,003 INFO L262 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (<= |ackermann_#in~m| 2)) (.cse1 (<= 5 |ackermann_#res|)) (.cse3 (<= 7 |ackermann_#res|)) (.cse5 (<= |ackermann_#in~n| 1)) (.cse4 (<= |ackermann_#in~m| 1))) (and (let ((.cse2 (<= 2 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2) (and .cse4 (<= 1 |ackermann_#in~m|) (<= 3 |ackermann_#res|)))) (let ((.cse7 (<= 5 |ackermann_#t~ret8|)) (.cse6 (<= |ackermann_#in~n| 2))) (or .cse5 (and .cse3 .cse6 .cse0 .cse7) (and .cse4 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret8|) .cse1) (and .cse3 (<= 6 |ackermann_#t~ret8|)) (and .cse4 (<= 6 |ackermann_#res|) .cse7 (<= |ackermann_#in~n| 4)) (and .cse4 (<= 4 |ackermann_#res|) .cse6))) (let ((.cse8 (= ackermann_~n |ackermann_#in~n|)) (.cse9 (= ackermann_~m |ackermann_#in~m|))) (or (and (<= 3 |ackermann_#t~ret8|) .cse8 .cse9) (and .cse5 .cse4 (<= 2 |ackermann_#t~ret8|) .cse8 .cse9))))) [2020-11-07 00:26:47,004 INFO L262 CegarLoopResult]: At program point L16(lines 16 24) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-11-07 00:26:47,004 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 00:26:47,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:26:47 BoogieIcfgContainer [2020-11-07 00:26:47,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:26:47,031 INFO L168 Benchmark]: Toolchain (without parser) took 75673.32 ms. Allocated memory was 151.0 MB in the beginning and 461.4 MB in the end (delta: 310.4 MB). Free memory was 110.2 MB in the beginning and 386.4 MB in the end (delta: -276.2 MB). Peak memory consumption was 264.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:47,032 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:26:47,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.20 ms. Allocated memory is still 151.0 MB. Free memory was 135.8 MB in the beginning and 126.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:47,033 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 125.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:47,033 INFO L168 Benchmark]: RCFGBuilder took 658.23 ms. Allocated memory is still 151.0 MB. Free memory was 124.9 MB in the beginning and 119.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:47,034 INFO L168 Benchmark]: TraceAbstraction took 74712.56 ms. Allocated memory was 151.0 MB in the beginning and 461.4 MB in the end (delta: 310.4 MB). Free memory was 119.6 MB in the beginning and 386.4 MB in the end (delta: -266.8 MB). Peak memory consumption was 274.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:47,036 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.21 ms. Allocated memory is still 151.0 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 239.20 ms. Allocated memory is still 151.0 MB. Free memory was 135.8 MB in the beginning and 126.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.60 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 125.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 658.23 ms. Allocated memory is still 151.0 MB. Free memory was 124.9 MB in the beginning and 119.9 MB in the end (delta: 4.9 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 74712.56 ms. Allocated memory was 151.0 MB in the beginning and 461.4 MB in the end (delta: 310.4 MB). Free memory was 119.6 MB in the beginning and 386.4 MB in the end (delta: -266.8 MB). Peak memory consumption was 274.4 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: 35.5s, OverallIterations: 11, TraceHistogramMax: 27, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 608 SDtfs, 1311 SDslu, 1051 SDs, 0 SdLazy, 6097 SolverSat, 1231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8777 ImplicationChecksByTransitivity, 22.2s 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, 301 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 2616 PreInvPairs, 8202 NumberOfFragments, 1265 HoareAnnotationTreeSize, 2616 FomulaSimplifications, 9184232 FormulaSimplificationTreeSizeReduction, 19.6s HoareSimplificationTime, 56 FomulaSimplificationsInter, 886335 FormulaSimplificationTreeSizeReductionInter, 19.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...