/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/sum_10x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:43:17,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:43:17,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:43:17,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:43:17,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:43:17,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:43:17,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:43:17,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:43:17,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:43:17,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:43:17,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:43:17,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:43:17,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:43:17,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:43:17,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:43:17,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:43:17,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:43:17,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:43:17,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:43:17,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:43:17,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:43:17,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:43:17,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:43:17,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:43:17,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:43:17,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:43:17,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:43:17,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:43:17,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:43:17,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:43:17,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:43:17,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:43:17,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:43:17,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:43:17,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:43:17,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:43:17,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:43:17,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:43:17,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:43:17,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:43:17,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:43:17,738 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:43:17,763 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:43:17,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:43:17,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:43:17,768 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:43:17,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:43:17,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:43:17,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:43:17,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:43:17,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:43:17,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:43:17,770 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:43:17,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:43:17,771 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:43:17,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:43:17,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:43:17,772 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:43:17,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:43:17,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:43:17,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:17,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:43:17,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:43:17,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:43:17,774 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:43:18,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:43:18,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:43:18,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:43:18,345 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:43:18,346 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:43:18,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2020-11-07 00:43:18,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcfea460c/17cfe890d9ed4ca49541ac9db1351d8b/FLAG09d9cc05e [2020-11-07 00:43:19,151 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:43:19,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2020-11-07 00:43:19,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcfea460c/17cfe890d9ed4ca49541ac9db1351d8b/FLAG09d9cc05e [2020-11-07 00:43:19,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcfea460c/17cfe890d9ed4ca49541ac9db1351d8b [2020-11-07 00:43:19,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:43:19,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:43:19,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:19,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:43:19,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:43:19,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dd2352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19, skipping insertion in model container [2020-11-07 00:43:19,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:43:19,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:43:19,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:19,727 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:43:19,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:19,770 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:43:19,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19 WrapperNode [2020-11-07 00:43:19,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:19,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:43:19,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:43:19,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:43:19,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (1/1) ... [2020-11-07 00:43:19,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:43:19,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:43:19,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:43:19,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:43:19,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (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:43:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:43:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:43:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:43:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 00:43:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:43:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:43:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:43:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:43:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:43:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 00:43:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:43:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:43:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:43:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:43:19,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:43:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:43:19,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:43:20,208 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:43:20,208 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:43:20,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:20 BoogieIcfgContainer [2020-11-07 00:43:20,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:43:20,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:43:20,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:43:20,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:43:20,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:43:19" (1/3) ... [2020-11-07 00:43:20,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e615a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:20, skipping insertion in model container [2020-11-07 00:43:20,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:19" (2/3) ... [2020-11-07 00:43:20,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e615a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:20, skipping insertion in model container [2020-11-07 00:43:20,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:20" (3/3) ... [2020-11-07 00:43:20,235 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2020-11-07 00:43:20,279 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:43:20,286 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:43:20,301 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:43:20,360 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:43:20,361 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:43:20,363 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:43:20,363 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:43:20,363 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:43:20,363 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:43:20,363 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:43:20,364 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:43:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 00:43:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:43:20,405 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:20,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:20,407 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 00:43:20,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:20,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1449121469] [2020-11-07 00:43:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:20,543 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:20,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:20,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:20,936 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:43:20,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1449121469] [2020-11-07 00:43:20,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:20,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:43:20,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187138943] [2020-11-07 00:43:20,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:43:20,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:20,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:43:20,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:43:20,968 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 00:43:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:21,267 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:43:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:43:21,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:43:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:21,280 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:43:21,281 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 00:43:21,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 00:43:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 00:43:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 00:43:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 00:43:21,343 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 00:43:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:21,344 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 00:43:21,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:43:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 00:43:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:43:21,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:21,347 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:21,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:43:21,348 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 00:43:21,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:21,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099213502] [2020-11-07 00:43:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:21,354 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:21,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:21,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:21,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 00:43:21,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099213502] [2020-11-07 00:43:21,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:21,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:43:21,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442255586] [2020-11-07 00:43:21,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:43:21,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:43:21,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:43:21,606 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 00:43:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:21,974 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 00:43:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:43:21,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 00:43:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:21,978 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:43:21,978 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:43:21,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:43:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:43:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:43:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 00:43:22,012 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 00:43:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:22,013 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 00:43:22,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:43:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 00:43:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:43:22,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:22,017 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1] [2020-11-07 00:43:22,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:43:22,017 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 00:43:22,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:22,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022045051] [2020-11-07 00:43:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:22,026 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:43:22,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022045051] [2020-11-07 00:43:22,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:22,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:43:22,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327299484] [2020-11-07 00:43:22,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:43:22,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:43:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:43:22,233 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 00:43:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:22,539 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 00:43:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:43:22,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 00:43:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:22,541 INFO L225 Difference]: With dead ends: 51 [2020-11-07 00:43:22,541 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 00:43:22,542 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:43:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 00:43:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 00:43:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 00:43:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 00:43:22,557 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 00:43:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:22,557 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 00:43:22,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:43:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 00:43:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:43:22,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:22,560 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1] [2020-11-07 00:43:22,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:43:22,560 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 00:43:22,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:22,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392550879] [2020-11-07 00:43:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:22,565 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 00:43:22,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392550879] [2020-11-07 00:43:22,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:22,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:43:22,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446461740] [2020-11-07 00:43:22,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:43:22,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:22,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:43:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:22,745 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 00:43:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:23,093 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 00:43:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:43:23,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 00:43:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:23,096 INFO L225 Difference]: With dead ends: 56 [2020-11-07 00:43:23,096 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 00:43:23,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 00:43:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 00:43:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 00:43:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 00:43:23,112 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 00:43:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:23,113 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 00:43:23,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:43:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 00:43:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:43:23,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:23,115 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:23,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:43:23,116 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 00:43:23,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:23,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438102052] [2020-11-07 00:43:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:23,122 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 00:43:23,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438102052] [2020-11-07 00:43:23,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:23,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:43:23,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294268997] [2020-11-07 00:43:23,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:43:23,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:23,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:43:23,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:43:23,401 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 00:43:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:23,856 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 00:43:23,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:43:23,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 00:43:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:23,859 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:43:23,859 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:43:23,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:43:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:43:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:43:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:43:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 00:43:23,874 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 00:43:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:23,875 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 00:43:23,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:43:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 00:43:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:43:23,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:23,877 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 1] [2020-11-07 00:43:23,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:43:23,877 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 00:43:23,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:23,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617796792] [2020-11-07 00:43:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:23,881 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:23,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 00:43:24,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617796792] [2020-11-07 00:43:24,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:24,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:43:24,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558854010] [2020-11-07 00:43:24,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:43:24,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:43:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:24,180 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 00:43:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:24,700 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 00:43:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:43:24,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 00:43:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:24,705 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:43:24,706 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:43:24,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:43:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:43:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:43:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:43:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 00:43:24,730 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 00:43:24,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:24,731 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 00:43:24,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:43:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 00:43:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:43:24,740 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:24,740 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 1] [2020-11-07 00:43:24,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:43:24,742 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 00:43:24,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:24,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268526787] [2020-11-07 00:43:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:24,747 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:24,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:43:25,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268526787] [2020-11-07 00:43:25,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:25,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:43:25,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863865461] [2020-11-07 00:43:25,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:43:25,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:43:25,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:43:25,111 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 00:43:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:25,599 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 00:43:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:43:25,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 00:43:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:25,601 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:43:25,601 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 00:43:25,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:43:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 00:43:25,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 00:43:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 00:43:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 00:43:25,618 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 00:43:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:25,619 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 00:43:25,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:43:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 00:43:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 00:43:25,620 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:25,620 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:25,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:43:25,621 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 00:43:25,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:25,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202637422] [2020-11-07 00:43:25,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:25,625 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 00:43:25,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202637422] [2020-11-07 00:43:25,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:25,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:43:25,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201865004] [2020-11-07 00:43:25,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:43:25,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:43:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:43:25,947 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 00:43:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:26,437 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 00:43:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:43:26,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 00:43:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:26,439 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:43:26,440 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:43:26,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:43:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:43:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 00:43:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:43:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 00:43:26,475 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 00:43:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:26,476 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 00:43:26,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:43:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 00:43:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:43:26,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:26,478 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:26,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:43:26,478 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:26,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:26,479 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 00:43:26,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:26,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393086423] [2020-11-07 00:43:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:26,482 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 00:43:26,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393086423] [2020-11-07 00:43:26,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:26,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:43:26,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089425248] [2020-11-07 00:43:26,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:43:26,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:43:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:43:26,878 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 00:43:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:27,435 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 00:43:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:43:27,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 00:43:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:27,437 INFO L225 Difference]: With dead ends: 81 [2020-11-07 00:43:27,437 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 00:43:27,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:43:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 00:43:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 00:43:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:43:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 00:43:27,462 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 00:43:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:27,464 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 00:43:27,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:43:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 00:43:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:43:27,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:27,466 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:27,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:43:27,467 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:27,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 00:43:27,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:27,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1447129872] [2020-11-07 00:43:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:27,473 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:43:28,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1447129872] [2020-11-07 00:43:28,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:28,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:43:28,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095083867] [2020-11-07 00:43:28,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:43:28,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:43:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:28,038 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 00:43:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:28,636 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 00:43:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:43:28,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 00:43:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:28,639 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:43:28,639 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:43:28,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:43:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:43:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:43:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:43:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 00:43:28,666 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 00:43:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:28,667 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 00:43:28,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:43:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 00:43:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 00:43:28,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:28,669 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:28,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:43:28,669 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:28,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:28,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 00:43:28,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:28,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079884317] [2020-11-07 00:43:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:28,677 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:43:28,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:43:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:43:28,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:43:28,819 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:43:28,819 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:43:28,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:43:28,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:43:28 BoogieIcfgContainer [2020-11-07 00:43:28,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:43:28,862 INFO L168 Benchmark]: Toolchain (without parser) took 9354.06 ms. Allocated memory was 167.8 MB in the beginning and 294.6 MB in the end (delta: 126.9 MB). Free memory was 144.1 MB in the beginning and 125.8 MB in the end (delta: 18.3 MB). Peak memory consumption was 145.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:28,863 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 167.8 MB. Free memory was 141.0 MB in the beginning and 140.9 MB in the end (delta: 102.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:43:28,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.85 ms. Allocated memory is still 167.8 MB. Free memory was 143.5 MB in the beginning and 134.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:28,865 INFO L168 Benchmark]: Boogie Preprocessor took 34.62 ms. Allocated memory is still 167.8 MB. Free memory was 134.6 MB in the beginning and 133.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:28,865 INFO L168 Benchmark]: RCFGBuilder took 408.86 ms. Allocated memory is still 167.8 MB. Free memory was 133.0 MB in the beginning and 120.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:28,866 INFO L168 Benchmark]: TraceAbstraction took 8639.81 ms. Allocated memory was 167.8 MB in the beginning and 294.6 MB in the end (delta: 126.9 MB). Free memory was 119.4 MB in the beginning and 125.8 MB in the end (delta: -6.4 MB). Peak memory consumption was 121.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:28,869 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 167.8 MB. Free memory was 141.0 MB in the beginning and 140.9 MB in the end (delta: 102.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 256.85 ms. Allocated memory is still 167.8 MB. Free memory was 143.5 MB in the beginning and 134.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.62 ms. Allocated memory is still 167.8 MB. Free memory was 134.6 MB in the beginning and 133.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 408.86 ms. Allocated memory is still 167.8 MB. Free memory was 133.0 MB in the beginning and 120.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8639.81 ms. Allocated memory was 167.8 MB in the beginning and 294.6 MB in the end (delta: 126.9 MB). Free memory was 119.4 MB in the beginning and 125.8 MB in the end (delta: -6.4 MB). Peak memory consumption was 121.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int a = 10; [L15] int b = 0; [L16] CALL, EXPR sum(a, b) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND FALSE !(n <= 0) [L9] CALL, EXPR sum(n - 1, m + 1) [L6] COND TRUE n <= 0 [L7] return m + n; [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] CALL reach_error() [L3] __assert_fail("0", "sum_10x0-2.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 664 SDslu, 580 SDs, 0 SdLazy, 904 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...