/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_o10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:46,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:46,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:46,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:46,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:46,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:46,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:46,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:46,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:46,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:46,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:46,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:46,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:46,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:46,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:46,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:46,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:46,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:46,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:46,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:46,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:46,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:46,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:46,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:46,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:46,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:46,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:46,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:46,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:46,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:46,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:46,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:46,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:46,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:46,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:46,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:46,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:46,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:46,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:46,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:46,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:46,849 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 05:07:46,862 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:46,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:46,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:46,864 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:46,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:46,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:46,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:46,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:46,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:46,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:46,866 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:46,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:46,867 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:46,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:46,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:46,867 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:46,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:46,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:46,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:46,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:46,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:46,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:46,869 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:07:47,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:47,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:47,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:47,298 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:47,299 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:47,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o10.c [2020-11-07 05:07:47,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d1b770e/c96f15c06251435eb2ed6f259a21b0e9/FLAG270d7f799 [2020-11-07 05:07:48,014 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:48,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o10.c [2020-11-07 05:07:48,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d1b770e/c96f15c06251435eb2ed6f259a21b0e9/FLAG270d7f799 [2020-11-07 05:07:48,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d1b770e/c96f15c06251435eb2ed6f259a21b0e9 [2020-11-07 05:07:48,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:48,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:48,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:48,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:48,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:48,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44de4859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48, skipping insertion in model container [2020-11-07 05:07:48,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:48,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:48,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:48,646 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:48,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:48,682 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:48,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48 WrapperNode [2020-11-07 05:07:48,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:48,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:48,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:48,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:48,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (1/1) ... [2020-11-07 05:07:48,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:48,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:48,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:48,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:48,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (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 05:07:48,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:48,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:48,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 05:07:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:49,121 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:49,122 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:49,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:49 BoogieIcfgContainer [2020-11-07 05:07:49,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:49,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:49,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:49,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:49,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:48" (1/3) ... [2020-11-07 05:07:49,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b50c99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:49, skipping insertion in model container [2020-11-07 05:07:49,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:48" (2/3) ... [2020-11-07 05:07:49,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b50c99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:49, skipping insertion in model container [2020-11-07 05:07:49,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:49" (3/3) ... [2020-11-07 05:07:49,138 INFO L111 eAbstractionObserver]: Analyzing ICFG id_o10.c [2020-11-07 05:07:49,155 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:49,159 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:49,174 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:49,203 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:49,203 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:49,203 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:49,203 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:49,203 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:49,204 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:49,204 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:49,204 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-11-07 05:07:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:49,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:49,296 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 05:07:49,296 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2039876327, now seen corresponding path program 1 times [2020-11-07 05:07:49,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:49,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1103080505] [2020-11-07 05:07:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:49,841 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 05:07:49,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1103080505] [2020-11-07 05:07:49,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:49,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:49,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615243364] [2020-11-07 05:07:49,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:49,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:49,872 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 6 states. [2020-11-07 05:07:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:50,263 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-07 05:07:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:50,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:50,282 INFO L225 Difference]: With dead ends: 50 [2020-11-07 05:07:50,283 INFO L226 Difference]: Without dead ends: 31 [2020-11-07 05:07:50,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-07 05:07:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-07 05:07:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-07 05:07:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-11-07 05:07:50,392 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2020-11-07 05:07:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:50,393 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-11-07 05:07:50,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-11-07 05:07:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-07 05:07:50,398 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:50,399 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] [2020-11-07 05:07:50,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:50,399 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:50,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1789799325, now seen corresponding path program 1 times [2020-11-07 05:07:50,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:50,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854750865] [2020-11-07 05:07:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:50,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854750865] [2020-11-07 05:07:50,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:50,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:50,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583176837] [2020-11-07 05:07:50,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:50,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:50,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:50,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:50,684 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states. [2020-11-07 05:07:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:51,092 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-11-07 05:07:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:51,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-11-07 05:07:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:51,094 INFO L225 Difference]: With dead ends: 41 [2020-11-07 05:07:51,095 INFO L226 Difference]: Without dead ends: 35 [2020-11-07 05:07:51,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-07 05:07:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-07 05:07:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-07 05:07:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-11-07 05:07:51,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-11-07 05:07:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:51,109 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-11-07 05:07:51,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-11-07 05:07:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-07 05:07:51,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:51,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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 05:07:51,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:51,112 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash 819538851, now seen corresponding path program 2 times [2020-11-07 05:07:51,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:51,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687727940] [2020-11-07 05:07:51,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:51,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687727940] [2020-11-07 05:07:51,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:51,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:51,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608637979] [2020-11-07 05:07:51,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:51,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:51,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:51,392 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states. [2020-11-07 05:07:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:51,963 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2020-11-07 05:07:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:51,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2020-11-07 05:07:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:51,965 INFO L225 Difference]: With dead ends: 45 [2020-11-07 05:07:51,965 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:07:51,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:07:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:07:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 05:07:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 05:07:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 05:07:51,978 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 39 [2020-11-07 05:07:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:51,978 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 05:07:51,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 05:07:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 05:07:51,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:51,981 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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 05:07:51,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:51,981 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1214666029, now seen corresponding path program 3 times [2020-11-07 05:07:51,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:51,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706802742] [2020-11-07 05:07:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:52,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706802742] [2020-11-07 05:07:52,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:52,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:52,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140413511] [2020-11-07 05:07:52,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:52,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:52,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:52,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:52,416 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states. [2020-11-07 05:07:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:53,323 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:07:53,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-11-07 05:07:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:53,326 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:53,326 INFO L226 Difference]: Without dead ends: 43 [2020-11-07 05:07:53,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-07 05:07:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-07 05:07:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-07 05:07:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2020-11-07 05:07:53,340 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 46 [2020-11-07 05:07:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:53,341 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2020-11-07 05:07:53,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2020-11-07 05:07:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 05:07:53,343 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:53,343 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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 05:07:53,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:53,343 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash -461443027, now seen corresponding path program 4 times [2020-11-07 05:07:53,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:53,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911490075] [2020-11-07 05:07:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:53,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911490075] [2020-11-07 05:07:53,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:53,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:53,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640984434] [2020-11-07 05:07:53,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:53,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:53,707 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 14 states. [2020-11-07 05:07:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:54,807 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2020-11-07 05:07:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:07:54,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-11-07 05:07:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:54,811 INFO L225 Difference]: With dead ends: 53 [2020-11-07 05:07:54,811 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:54,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:07:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:54,826 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 53 [2020-11-07 05:07:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:54,826 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:54,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:07:54,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:54,828 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 05:07:54,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:54,828 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1951577079, now seen corresponding path program 5 times [2020-11-07 05:07:54,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:54,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1058494030] [2020-11-07 05:07:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:55,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1058494030] [2020-11-07 05:07:55,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:55,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:07:55,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012826592] [2020-11-07 05:07:55,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:07:55,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:07:55,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:07:55,227 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states. [2020-11-07 05:07:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:56,455 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2020-11-07 05:07:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:07:56,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2020-11-07 05:07:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:56,460 INFO L225 Difference]: With dead ends: 57 [2020-11-07 05:07:56,460 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 05:07:56,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:07:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 05:07:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 05:07:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:07:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-11-07 05:07:56,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 60 [2020-11-07 05:07:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:56,490 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-11-07 05:07:56,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:07:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-11-07 05:07:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:07:56,492 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:56,492 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 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 05:07:56,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:56,493 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1085586761, now seen corresponding path program 6 times [2020-11-07 05:07:56,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:56,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798499269] [2020-11-07 05:07:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:57,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798499269] [2020-11-07 05:07:57,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:57,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:07:57,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934330318] [2020-11-07 05:07:57,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:07:57,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:07:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:07:57,083 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 18 states. [2020-11-07 05:07:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:58,679 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 05:07:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:07:58,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2020-11-07 05:07:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:58,681 INFO L225 Difference]: With dead ends: 61 [2020-11-07 05:07:58,681 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:07:58,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2020-11-07 05:07:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:07:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-11-07 05:07:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-07 05:07:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-11-07 05:07:58,696 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 67 [2020-11-07 05:07:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:58,697 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-11-07 05:07:58,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:07:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-11-07 05:07:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-07 05:07:58,699 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:58,699 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 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 05:07:58,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:58,699 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1506086719, now seen corresponding path program 7 times [2020-11-07 05:07:58,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:58,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [378290579] [2020-11-07 05:07:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:07:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:58,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:59,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [378290579] [2020-11-07 05:07:59,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:59,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:07:59,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220292862] [2020-11-07 05:07:59,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:07:59,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:59,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:07:59,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:07:59,304 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 20 states. [2020-11-07 05:08:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:01,201 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-11-07 05:08:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:08:01,202 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2020-11-07 05:08:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:01,203 INFO L225 Difference]: With dead ends: 65 [2020-11-07 05:08:01,203 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:08:01,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:08:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:08:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:08:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:08:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 05:08:01,219 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 74 [2020-11-07 05:08:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:01,220 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 05:08:01,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:08:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 05:08:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:08:01,221 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:01,222 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 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 05:08:01,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:08:01,222 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1924014913, now seen corresponding path program 8 times [2020-11-07 05:08:01,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:01,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947905998] [2020-11-07 05:08:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:08:01,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947905998] [2020-11-07 05:08:01,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:01,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:08:01,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439681868] [2020-11-07 05:08:01,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:08:01,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:08:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:08:01,895 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 22 states. [2020-11-07 05:08:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:04,169 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:08:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 05:08:04,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2020-11-07 05:08:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:04,171 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:08:04,171 INFO L226 Difference]: Without dead ends: 63 [2020-11-07 05:08:04,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 05:08:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-07 05:08:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-07 05:08:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 05:08:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2020-11-07 05:08:04,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 81 [2020-11-07 05:08:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:04,189 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2020-11-07 05:08:04,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:08:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2020-11-07 05:08:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-07 05:08:04,192 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:04,192 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 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 05:08:04,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:08:04,193 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1815934069, now seen corresponding path program 9 times [2020-11-07 05:08:04,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:04,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71514623] [2020-11-07 05:08:04,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:08:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:08:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:04,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:08:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:08:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:08:05,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71514623] [2020-11-07 05:08:05,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:08:05,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:08:05,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532209355] [2020-11-07 05:08:05,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:08:05,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:08:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:08:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:08:05,061 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states. [2020-11-07 05:08:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:08:07,561 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2020-11-07 05:08:07,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-07 05:08:07,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2020-11-07 05:08:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:08:07,564 INFO L225 Difference]: With dead ends: 73 [2020-11-07 05:08:07,564 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:08:07,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=199, Invalid=2771, Unknown=0, NotChecked=0, Total=2970 [2020-11-07 05:08:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:08:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:08:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:08:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:08:07,578 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 88 [2020-11-07 05:08:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:08:07,579 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:08:07,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:08:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:08:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-07 05:08:07,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:08:07,581 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 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 05:08:07,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:08:07,581 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:08:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:08:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1550347829, now seen corresponding path program 10 times [2020-11-07 05:08:07,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:08:07,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696717668] [2020-11-07 05:08:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:08:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:08:07,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:08:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:08:07,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:08:07,762 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:08:07,762 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:08:07,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:08:07,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:07 BoogieIcfgContainer [2020-11-07 05:08:07,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:08:07,887 INFO L168 Benchmark]: Toolchain (without parser) took 19508.52 ms. Allocated memory was 125.8 MB in the beginning and 262.1 MB in the end (delta: 136.3 MB). Free memory was 102.7 MB in the beginning and 138.9 MB in the end (delta: -36.1 MB). Peak memory consumption was 101.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:07,888 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 125.8 MB. Free memory is still 87.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:08:07,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.63 ms. Allocated memory is still 125.8 MB. Free memory was 102.2 MB in the beginning and 93.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:07,895 INFO L168 Benchmark]: Boogie Preprocessor took 36.18 ms. Allocated memory is still 125.8 MB. Free memory was 93.1 MB in the beginning and 91.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:07,895 INFO L168 Benchmark]: RCFGBuilder took 403.20 ms. Allocated memory is still 125.8 MB. Free memory was 91.9 MB in the beginning and 79.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:07,899 INFO L168 Benchmark]: TraceAbstraction took 18755.16 ms. Allocated memory was 125.8 MB in the beginning and 262.1 MB in the end (delta: 136.3 MB). Free memory was 78.7 MB in the beginning and 138.9 MB in the end (delta: -60.2 MB). Peak memory consumption was 77.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:08:07,905 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15 ms. Allocated memory is still 125.8 MB. Free memory is still 87.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 298.63 ms. Allocated memory is still 125.8 MB. Free memory was 102.2 MB in the beginning and 93.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.18 ms. Allocated memory is still 125.8 MB. Free memory was 93.1 MB in the beginning and 91.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 403.20 ms. Allocated memory is still 125.8 MB. Free memory was 91.9 MB in the beginning and 79.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18755.16 ms. Allocated memory was 125.8 MB in the beginning and 262.1 MB in the end (delta: 136.3 MB). Free memory was 78.7 MB in the beginning and 138.9 MB in the end (delta: -60.2 MB). Peak memory consumption was 77.3 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] unsigned int input = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=10, input=10] [L13] CALL, EXPR id(input) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 VAL [\old(x)=0, x=0] [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L13] RET, EXPR id(input) VAL [id(input)=10, input=10] [L13] unsigned int result = id(input); VAL [id(input)=10, input=10, result=10] [L14] COND TRUE result == 10 VAL [input=10, result=10] [L15] CALL reach_error() [L4] __assert_fail("0", "id_o10.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.5s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 345 SDtfs, 356 SDslu, 1837 SDs, 0 SdLazy, 4343 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 660 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 145905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/1020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...