/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_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:42:20,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:42:20,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:42:20,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:42:20,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:42:20,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:42:20,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:42:20,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:42:20,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:42:20,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:42:20,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:42:20,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:42:20,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:42:20,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:42:20,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:42:20,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:42:20,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:42:20,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:42:20,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:42:20,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:42:20,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:42:20,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:42:20,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:42:20,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:42:20,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:42:20,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:42:20,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:42:20,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:42:20,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:42:20,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:42:20,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:42:20,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:42:20,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:42:20,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:42:20,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:42:20,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:42:20,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:42:20,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:42:20,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:42:20,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:42:20,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:42:20,809 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:42:20,831 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:42:20,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:42:20,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:42:20,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:42:20,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:42:20,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:42:20,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:42:20,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:42:20,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:42:20,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:42:20,840 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:42:20,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:42:20,840 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:42:20,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:42:20,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:42:20,841 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:42:20,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:42:20,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:42:20,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:42:20,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:42:20,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:42:20,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:42:20,843 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:42:21,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:42:21,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:42:21,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:42:21,326 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:42:21,327 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:42:21,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-11-07 00:42:21,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff1c6e34/19ad138b0890439097a5889d474f1966/FLAG26b1991fc [2020-11-07 00:42:22,248 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:42:22,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i5_o5-2.c [2020-11-07 00:42:22,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff1c6e34/19ad138b0890439097a5889d474f1966/FLAG26b1991fc [2020-11-07 00:42:22,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff1c6e34/19ad138b0890439097a5889d474f1966 [2020-11-07 00:42:22,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:42:22,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:42:22,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:42:22,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:42:22,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:42:22,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b1c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22, skipping insertion in model container [2020-11-07 00:42:22,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:42:22,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:42:22,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:42:22,847 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:42:22,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:42:22,887 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:42:22,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22 WrapperNode [2020-11-07 00:42:22,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:42:22,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:42:22,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:42:22,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:42:22,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (1/1) ... [2020-11-07 00:42:22,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:42:22,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:42:22,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:42:22,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:42:22,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (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:42:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:42:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:42:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:42:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:42:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:42:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:42:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:42:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:42:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:42:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:42:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:42:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:42:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:42:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:42:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:42:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:42:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:42:23,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:42:23,478 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:42:23,479 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:42:23,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:23 BoogieIcfgContainer [2020-11-07 00:42:23,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:42:23,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:42:23,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:42:23,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:42:23,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:22" (1/3) ... [2020-11-07 00:42:23,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bba26b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:23, skipping insertion in model container [2020-11-07 00:42:23,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:22" (2/3) ... [2020-11-07 00:42:23,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bba26b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:23, skipping insertion in model container [2020-11-07 00:42:23,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:23" (3/3) ... [2020-11-07 00:42:23,496 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2020-11-07 00:42:23,518 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:42:23,547 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:42:23,565 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:42:23,596 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:42:23,596 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:42:23,596 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:42:23,596 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:42:23,597 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:42:23,597 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:42:23,597 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:42:23,597 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:42:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 00:42:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:42:23,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:23,628 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:42:23,628 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 00:42:23,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:23,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532196983] [2020-11-07 00:42:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:23,741 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,078 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:42:24,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532196983] [2020-11-07 00:42:24,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:24,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:42:24,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463643203] [2020-11-07 00:42:24,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:42:24,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:24,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:42:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:42:24,110 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 00:42:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:24,441 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-07 00:42:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:42:24,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:42:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:24,456 INFO L225 Difference]: With dead ends: 50 [2020-11-07 00:42:24,456 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 00:42:24,460 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:42:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 00:42:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 00:42:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 00:42:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 00:42:24,525 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 00:42:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:24,526 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 00:42:24,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:42:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 00:42:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:42:24,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:24,529 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:42:24,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:42:24,530 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:24,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:24,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 00:42:24,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:24,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943866273] [2020-11-07 00:42:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:24,536 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,752 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:42:24,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943866273] [2020-11-07 00:42:24,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:24,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:42:24,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447960744] [2020-11-07 00:42:24,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:42:24,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:24,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:42:24,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:42:24,757 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 00:42:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:25,033 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 00:42:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:42:25,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 00:42:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:25,035 INFO L225 Difference]: With dead ends: 44 [2020-11-07 00:42:25,035 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:42:25,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:42:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:42:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:42:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:42:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 00:42:25,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 00:42:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:25,054 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 00:42:25,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:42:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 00:42:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 00:42:25,056 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:25,056 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:42:25,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:42:25,057 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:25,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 00:42:25,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:25,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845737937] [2020-11-07 00:42:25,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:25,062 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,323 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:42:25,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845737937] [2020-11-07 00:42:25,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:25,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:42:25,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419769620] [2020-11-07 00:42:25,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:42:25,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:42:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:42:25,327 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 00:42:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:25,677 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 00:42:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:42:25,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 00:42:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:25,680 INFO L225 Difference]: With dead ends: 49 [2020-11-07 00:42:25,680 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:42:25,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:42:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 00:42:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 00:42:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 00:42:25,698 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 00:42:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:25,699 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 00:42:25,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:42:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 00:42:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 00:42:25,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:25,701 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:42:25,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:42:25,702 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 00:42:25,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:25,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28304667] [2020-11-07 00:42:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:25,707 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,946 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:42:25,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28304667] [2020-11-07 00:42:25,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:25,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:42:25,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170825340] [2020-11-07 00:42:25,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:42:25,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:42:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:42:25,949 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 00:42:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:26,364 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 00:42:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:42:26,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 00:42:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:26,367 INFO L225 Difference]: With dead ends: 54 [2020-11-07 00:42:26,367 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 00:42:26,368 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:42:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 00:42:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 00:42:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 00:42:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 00:42:26,384 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 00:42:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:26,385 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 00:42:26,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:42:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 00:42:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:42:26,388 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:26,388 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:42:26,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:42:26,389 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 00:42:26,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:26,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1332958429] [2020-11-07 00:42:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:26,393 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,824 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:42:26,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1332958429] [2020-11-07 00:42:26,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:26,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:42:26,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89039098] [2020-11-07 00:42:26,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:42:26,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:42:26,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:42:26,828 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 00:42:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:27,374 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 00:42:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:42:27,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 00:42:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:27,380 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:42:27,380 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:42:27,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:42:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:42:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:42:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:42:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 00:42:27,422 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 00:42:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:27,423 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 00:42:27,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:42:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 00:42:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:42:27,429 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:27,429 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:42:27,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:42:27,430 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:27,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 00:42:27,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:27,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2020436294] [2020-11-07 00:42:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:27,437 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,955 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:42:27,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2020436294] [2020-11-07 00:42:27,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:27,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:42:27,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379073677] [2020-11-07 00:42:27,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:42:27,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:42:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:42:27,962 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 16 states. [2020-11-07 00:42:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:29,432 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 00:42:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:42:29,433 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2020-11-07 00:42:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:29,436 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:42:29,436 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 00:42:29,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:42:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 00:42:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 00:42:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:42:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 00:42:29,459 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 00:42:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:29,460 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 00:42:29,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:42:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 00:42:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:42:29,462 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:29,462 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:42:29,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:42:29,463 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 00:42:29,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:29,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748942415] [2020-11-07 00:42:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:29,467 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,750 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:42:29,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748942415] [2020-11-07 00:42:29,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:29,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:42:29,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71330382] [2020-11-07 00:42:29,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:42:29,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:42:29,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:42:29,754 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 00:42:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:30,313 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-11-07 00:42:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:42:30,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 00:42:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:30,315 INFO L225 Difference]: With dead ends: 57 [2020-11-07 00:42:30,315 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:42:30,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:42:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:42:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:42:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:42:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:42:30,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-11-07 00:42:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:30,317 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:42:30,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:42:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:42:30,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:42:30,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:42:30,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:42:31,036 WARN L194 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2020-11-07 00:42:31,432 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2020-11-07 00:42:31,770 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-07 00:42:31,999 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-11-07 00:42:32,434 WARN L194 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2020-11-07 00:42:32,441 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,441 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,441 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,441 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,441 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,442 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,442 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,442 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,442 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,442 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:42:32,443 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,443 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,443 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:42:32,443 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,444 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,444 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,444 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,444 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:42:32,445 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-11-07 00:42:32,445 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 5 main_~input~0) [2020-11-07 00:42:32,445 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-11-07 00:42:32,445 INFO L262 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:42:32,445 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-11-07 00:42:32,445 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-11-07 00:42:32,446 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 5) (<= 5 |main_#t~ret8|) (<= 5 main_~input~0)) [2020-11-07 00:42:32,446 INFO L262 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 5 main_~input~0) [2020-11-07 00:42:32,446 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 5) (<= 5 |main_#t~ret8|) (<= 5 main_~input~0)) [2020-11-07 00:42:32,446 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 5) (<= 5 |main_#t~ret8|) (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:42:32,447 INFO L262 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= 6 |id_#in~x|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) .cse0 (<= |id_#res| 5)))) [2020-11-07 00:42:32,447 INFO L262 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= 6 |id_#in~x|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) .cse0 (<= |id_#res| 5)))) [2020-11-07 00:42:32,447 INFO L262 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 00:42:32,447 INFO L269 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-11-07 00:42:32,447 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 00:42:32,448 INFO L262 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#in~x|) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)))) [2020-11-07 00:42:32,448 INFO L262 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-11-07 00:42:32,448 INFO L262 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#in~x|) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)))) [2020-11-07 00:42:32,449 INFO L262 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#res|) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 4)))) (or (<= 5 |id_#in~x|) (and (<= |id_#res| 4) (<= 4 |id_#res|) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 1 |id_#in~x|) (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 2 |id_#res|) (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)))) [2020-11-07 00:42:32,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:42:32 BoogieIcfgContainer [2020-11-07 00:42:32,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:42:32,486 INFO L168 Benchmark]: Toolchain (without parser) took 9862.02 ms. Allocated memory was 151.0 MB in the beginning and 224.4 MB in the end (delta: 73.4 MB). Free memory was 127.6 MB in the beginning and 103.9 MB in the end (delta: 23.7 MB). Peak memory consumption was 125.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:32,492 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 125.2 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:42:32,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.63 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 117.4 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:42:32,493 INFO L168 Benchmark]: Boogie Preprocessor took 39.94 ms. Allocated memory is still 151.0 MB. Free memory was 117.4 MB in the beginning and 116.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:32,497 INFO L168 Benchmark]: RCFGBuilder took 550.95 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 103.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:32,498 INFO L168 Benchmark]: TraceAbstraction took 8995.12 ms. Allocated memory was 151.0 MB in the beginning and 224.4 MB in the end (delta: 73.4 MB). Free memory was 103.0 MB in the beginning and 103.9 MB in the end (delta: -931.8 kB). Peak memory consumption was 101.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:32,507 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.24 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 125.2 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 255.63 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 117.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.94 ms. Allocated memory is still 151.0 MB. Free memory was 117.4 MB in the beginning and 116.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 550.95 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 103.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8995.12 ms. Allocated memory was 151.0 MB in the beginning and 224.4 MB in the end (delta: 73.4 MB). Free memory was 103.0 MB in the beginning and 103.9 MB in the end (delta: -931.8 kB). Peak memory consumption was 101.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: (((((((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || (\old(x) == x && 6 <= \old(x))) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || (((5 <= \result && 5 <= \old(x)) && \old(x) == x) && \result <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 7, TraceHistogramMax: 7, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 215 SDtfs, 282 SDslu, 535 SDs, 0 SdLazy, 962 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 70 PreInvPairs, 179 NumberOfFragments, 584 HoareAnnotationTreeSize, 70 FomulaSimplifications, 2111 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 37 FomulaSimplificationsInter, 2545 FormulaSimplificationTreeSizeReductionInter, 1.8s 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...