/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:50,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:50,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:50,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:50,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:50,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:50,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:50,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:50,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:50,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:50,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:50,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:50,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:50,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:50,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:50,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:50,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:50,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:50,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:50,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:50,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:50,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:50,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:50,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:50,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:50,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:50,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:50,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:50,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:50,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:50,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:50,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:50,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:50,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:50,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:50,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:50,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:50,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:50,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:50,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:50,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:50,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:41:50,914 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:50,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:50,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:50,921 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:50,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:50,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:50,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:50,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:50,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:50,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:50,923 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:50,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:50,924 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:50,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:50,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:50,925 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:50,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:50,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:50,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:50,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:50,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:50,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:50,927 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:41:51,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:51,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:51,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:51,494 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:51,495 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:51,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-11-07 00:41:51,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02faf2da/9847d9ca0e7f4107af30344087c23155/FLAG174b109d2 [2020-11-07 00:41:52,328 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:52,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-11-07 00:41:52,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02faf2da/9847d9ca0e7f4107af30344087c23155/FLAG174b109d2 [2020-11-07 00:41:52,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02faf2da/9847d9ca0e7f4107af30344087c23155 [2020-11-07 00:41:52,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:52,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:52,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:52,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:52,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:52,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0bf3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52, skipping insertion in model container [2020-11-07 00:41:52,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:52,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:52,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:52,893 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:52,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:52,934 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:52,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52 WrapperNode [2020-11-07 00:41:52,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:52,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:52,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:52,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:52,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... [2020-11-07 00:41:52,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:52,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:52,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:52,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:53,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:53,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:41:53,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:53,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:41:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:53,108 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:41:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:53,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:53,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:53,445 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:53,445 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:53,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:53 BoogieIcfgContainer [2020-11-07 00:41:53,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:53,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:53,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:53,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:53,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:52" (1/3) ... [2020-11-07 00:41:53,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5600838b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:53, skipping insertion in model container [2020-11-07 00:41:53,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:52" (2/3) ... [2020-11-07 00:41:53,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5600838b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:53, skipping insertion in model container [2020-11-07 00:41:53,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:53" (3/3) ... [2020-11-07 00:41:53,461 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2020-11-07 00:41:53,484 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:53,489 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:53,506 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:53,539 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:53,540 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:53,540 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:53,540 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:53,540 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:53,540 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:53,540 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:53,541 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 00:41:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:53,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:53,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:53,595 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 00:41:53,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:53,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373258104] [2020-11-07 00:41:53,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:53,717 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:54,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:54,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:41:54,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373258104] [2020-11-07 00:41:54,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:54,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:54,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459223536] [2020-11-07 00:41:54,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:54,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:54,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:54,102 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 00:41:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:54,756 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:41:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:54,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:54,769 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:41:54,770 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 00:41:54,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 00:41:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 00:41:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 00:41:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 00:41:54,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 00:41:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:54,834 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 00:41:54,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 00:41:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:41:54,840 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:54,841 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:54,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:54,841 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 00:41:54,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:54,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1172578317] [2020-11-07 00:41:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:54,855 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:54,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:54,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:55,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1172578317] [2020-11-07 00:41:55,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:55,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:41:55,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764631462] [2020-11-07 00:41:55,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:41:55,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:41:55,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:41:55,063 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 00:41:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:55,380 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 00:41:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:55,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 00:41:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:55,383 INFO L225 Difference]: With dead ends: 44 [2020-11-07 00:41:55,383 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:41:55,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:41:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:41:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:41:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 00:41:55,401 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 00:41:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:55,401 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 00:41:55,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:41:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 00:41:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 00:41:55,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:55,403 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:55,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:55,404 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 00:41:55,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:55,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404687253] [2020-11-07 00:41:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:55,409 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 00:41:55,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404687253] [2020-11-07 00:41:55,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:55,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:55,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274548972] [2020-11-07 00:41:55,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:55,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:55,717 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 00:41:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:56,133 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 00:41:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:56,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 00:41:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:56,136 INFO L225 Difference]: With dead ends: 49 [2020-11-07 00:41:56,137 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:41:56,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:41:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:41:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 00:41:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 00:41:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 00:41:56,154 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 00:41:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:56,154 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 00:41:56,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 00:41:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 00:41:56,157 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:56,157 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-11-07 00:41:56,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:56,157 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 00:41:56,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:56,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [996721207] [2020-11-07 00:41:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:56,162 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 00:41:56,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [996721207] [2020-11-07 00:41:56,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:56,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:56,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633776915] [2020-11-07 00:41:56,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:56,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:56,412 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 00:41:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:56,850 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 00:41:56,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:41:56,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 00:41:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:56,853 INFO L225 Difference]: With dead ends: 54 [2020-11-07 00:41:56,853 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 00:41:56,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 00:41:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 00:41:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 00:41:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 00:41:56,875 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 00:41:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:56,878 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 00:41:56,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 00:41:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:41:56,883 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:56,883 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:41:56,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:56,884 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 00:41:56,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:56,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2085413751] [2020-11-07 00:41:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:56,890 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 00:41:57,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2085413751] [2020-11-07 00:41:57,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:57,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:41:57,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756479069] [2020-11-07 00:41:57,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:41:57,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:41:57,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:57,213 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 00:41:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:57,704 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 00:41:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:41:57,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 00:41:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:57,708 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:41:57,708 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:41:57,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:41:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:41:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:41:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 00:41:57,740 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 00:41:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:57,740 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 00:41:57,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:41:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 00:41:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:41:57,742 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:57,742 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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] [2020-11-07 00:41:57,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:57,743 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 00:41:57,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:57,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1804987560] [2020-11-07 00:41:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:57,747 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 00:41:58,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1804987560] [2020-11-07 00:41:58,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:58,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:41:58,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089786862] [2020-11-07 00:41:58,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:41:58,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:41:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:58,202 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 00:41:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:58,743 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 00:41:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:58,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 00:41:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:58,746 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:41:58,746 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 00:41:58,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:41:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 00:41:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 00:41:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:41:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 00:41:58,763 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 00:41:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:58,764 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 00:41:58,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:41:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 00:41:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:41:58,766 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:58,766 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:58,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:58,767 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 00:41:58,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:58,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811666690] [2020-11-07 00:41:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:58,771 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 00:41:59,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811666690] [2020-11-07 00:41:59,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:59,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:41:59,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467335402] [2020-11-07 00:41:59,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:41:59,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:41:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:59,199 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 00:41:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:59,801 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 00:41:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:41:59,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 00:41:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:59,806 INFO L225 Difference]: With dead ends: 69 [2020-11-07 00:41:59,806 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 00:41:59,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:41:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 00:41:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 00:41:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:41:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 00:41:59,824 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 00:41:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:59,824 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 00:41:59,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:41:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 00:41:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:41:59,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:59,826 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:59,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:59,827 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:59,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 00:41:59,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:59,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [969086837] [2020-11-07 00:41:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:59,831 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 00:42:00,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [969086837] [2020-11-07 00:42:00,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:00,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:42:00,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837538172] [2020-11-07 00:42:00,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:42:00,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:42:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:00,246 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 00:42:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:00,925 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 00:42:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:42:00,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 00:42:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:00,928 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:42:00,930 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 00:42:00,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:42:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 00:42:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 00:42:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 00:42:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 00:42:00,957 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 00:42:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:00,957 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 00:42:00,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:42:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 00:42:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 00:42:00,966 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:00,966 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 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:42:00,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:42:00,966 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 00:42:00,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:00,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [838635465] [2020-11-07 00:42:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:00,973 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 00:42:01,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [838635465] [2020-11-07 00:42:01,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:01,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:42:01,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331676873] [2020-11-07 00:42:01,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:42:01,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:01,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:42:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:42:01,507 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 00:42:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:02,162 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 00:42:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:42:02,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 00:42:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:02,179 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:42:02,180 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 00:42:02,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:42:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 00:42:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 00:42:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 00:42:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 00:42:02,220 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 00:42:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:02,221 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 00:42:02,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:42:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 00:42:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:42:02,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:02,224 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 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:42:02,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:42:02,225 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 00:42:02,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:02,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944571778] [2020-11-07 00:42:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:02,232 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 00:42:02,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944571778] [2020-11-07 00:42:02,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:02,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:42:02,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047294898] [2020-11-07 00:42:02,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:42:02,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:42:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:42:02,712 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 00:42:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:03,484 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 00:42:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:42:03,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 00:42:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:03,489 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:42:03,490 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:42:03,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:42:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:42:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 00:42:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 00:42:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 00:42:03,526 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 00:42:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:03,527 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 00:42:03,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:42:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 00:42:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 00:42:03,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:03,529 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 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:42:03,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:42:03,530 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 00:42:03,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:03,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22055094] [2020-11-07 00:42:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:03,535 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:42:03,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:42:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:42:03,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:42:03,647 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:42:03,647 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:42:03,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:42:03,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:42:03 BoogieIcfgContainer [2020-11-07 00:42:03,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:42:03,689 INFO L168 Benchmark]: Toolchain (without parser) took 11010.76 ms. Allocated memory was 153.1 MB in the beginning and 228.6 MB in the end (delta: 75.5 MB). Free memory was 129.6 MB in the beginning and 123.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 83.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:03,690 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 153.1 MB. Free memory is still 126.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:42:03,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.84 ms. Allocated memory is still 153.1 MB. Free memory was 128.8 MB in the beginning and 119.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:03,697 INFO L168 Benchmark]: Boogie Preprocessor took 57.58 ms. Allocated memory is still 153.1 MB. Free memory was 119.4 MB in the beginning and 117.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:03,697 INFO L168 Benchmark]: RCFGBuilder took 449.96 ms. Allocated memory is still 153.1 MB. Free memory was 117.9 MB in the beginning and 104.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:03,698 INFO L168 Benchmark]: TraceAbstraction took 10234.69 ms. Allocated memory was 153.1 MB in the beginning and 228.6 MB in the end (delta: 75.5 MB). Free memory was 104.3 MB in the beginning and 123.3 MB in the end (delta: -19.0 MB). Peak memory consumption was 57.9 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:03,705 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.19 ms. Allocated memory is still 153.1 MB. Free memory is still 126.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 252.84 ms. Allocated memory is still 153.1 MB. Free memory was 128.8 MB in the beginning and 119.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.58 ms. Allocated memory is still 153.1 MB. Free memory was 119.4 MB in the beginning and 117.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 449.96 ms. Allocated memory is still 153.1 MB. Free memory was 117.9 MB in the beginning and 104.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10234.69 ms. Allocated memory was 153.1 MB in the beginning and 228.6 MB in the end (delta: 75.5 MB). Free memory was 104.3 MB in the beginning and 123.3 MB in the end (delta: -19.0 MB). Peak memory consumption was 57.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 10; [L13] CALL, EXPR id(input) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND TRUE x==0 [L7] return 0; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) [L13] int result = id(input); [L14] COND TRUE result == 10 [L15] CALL reach_error() [L4] __assert_fail("0", "id_i10_o10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.1s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 640 SDslu, 572 SDs, 0 SdLazy, 824 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...