/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:28:07,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:28:07,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:28:08,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:28:08,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:28:08,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:28:08,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:28:08,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:28:08,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:28:08,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:28:08,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:28:08,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:28:08,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:28:08,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:28:08,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:28:08,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:28:08,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:28:08,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:28:08,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:28:08,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:28:08,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:28:08,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:28:08,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:28:08,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:28:08,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:28:08,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:28:08,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:28:08,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:28:08,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:28:08,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:28:08,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:28:08,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:28:08,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:28:08,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:28:08,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:28:08,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:28:08,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:28:08,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:28:08,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:28:08,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:28:08,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:28:08,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:28:08,150 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:28:08,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:28:08,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:28:08,157 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:28:08,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:28:08,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:28:08,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:28:08,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:28:08,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:28:08,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:28:08,161 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:28:08,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:28:08,162 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:28:08,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:28:08,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:28:08,163 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:28:08,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:28:08,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:28:08,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:08,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:28:08,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:28:08,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:28:08,165 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-10-23 20:28:08,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:28:08,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:28:08,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:28:08,729 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:28:08,730 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:28:08,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2020-10-23 20:28:08,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/602148c2b/e8e95b77bbe949a497d06e0fec3463d3/FLAGcfd2816bb [2020-10-23 20:28:09,493 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:28:09,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2020-10-23 20:28:09,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/602148c2b/e8e95b77bbe949a497d06e0fec3463d3/FLAGcfd2816bb [2020-10-23 20:28:09,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/602148c2b/e8e95b77bbe949a497d06e0fec3463d3 [2020-10-23 20:28:09,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:28:09,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:28:09,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:09,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:28:09,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:28:09,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:09" (1/1) ... [2020-10-23 20:28:09,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae45957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:09, skipping insertion in model container [2020-10-23 20:28:09,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:09" (1/1) ... [2020-10-23 20:28:09,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:28:09,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:28:10,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:10,083 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:28:10,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:10,115 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:28:10,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10 WrapperNode [2020-10-23 20:28:10,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:10,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:28:10,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:28:10,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:28:10,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (1/1) ... [2020-10-23 20:28:10,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:28:10,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:28:10,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:28:10,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:28:10,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (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-10-23 20:28:10,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:28:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:28:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:28:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-10-23 20:28:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:28:10,320 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:28:10,320 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:28:10,320 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:28:10,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:28:10,320 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-10-23 20:28:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:28:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:28:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:28:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:28:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:28:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:28:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:28:10,779 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:28:10,780 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:28:10,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:10 BoogieIcfgContainer [2020-10-23 20:28:10,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:28:10,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:28:10,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:28:10,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:28:10,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:28:09" (1/3) ... [2020-10-23 20:28:10,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:10, skipping insertion in model container [2020-10-23 20:28:10,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:10" (2/3) ... [2020-10-23 20:28:10,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:10, skipping insertion in model container [2020-10-23 20:28:10,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:10" (3/3) ... [2020-10-23 20:28:10,792 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2020-10-23 20:28:10,805 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:28:10,811 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:28:10,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:28:10,854 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:28:10,855 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:28:10,855 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:28:10,855 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:28:10,855 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:28:10,856 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:28:10,856 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:28:10,856 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:28:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-23 20:28:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 20:28:10,882 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:10,883 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-10-23 20:28:10,883 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-10-23 20:28:10,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:10,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807572507] [2020-10-23 20:28:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:10,987 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:11,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:11,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:28:11,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807572507] [2020-10-23 20:28:11,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:11,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:28:11,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53070009] [2020-10-23 20:28:11,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:28:11,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:11,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:28:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:28:11,337 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-10-23 20:28:11,730 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-23 20:28:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:11,871 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-23 20:28:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:28:11,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-23 20:28:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:11,884 INFO L225 Difference]: With dead ends: 52 [2020-10-23 20:28:11,884 INFO L226 Difference]: Without dead ends: 34 [2020-10-23 20:28:11,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-23 20:28:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-23 20:28:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-23 20:28:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-10-23 20:28:11,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-10-23 20:28:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:11,976 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-23 20:28:11,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:28:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-10-23 20:28:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-23 20:28:11,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:11,984 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-10-23 20:28:11,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:28:11,985 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:11,986 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-10-23 20:28:11,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:11,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684085422] [2020-10-23 20:28:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:12,000 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-23 20:28:12,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684085422] [2020-10-23 20:28:12,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:12,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:28:12,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834511391] [2020-10-23 20:28:12,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:28:12,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:28:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:28:12,230 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-10-23 20:28:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:12,756 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-10-23 20:28:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:28:12,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-10-23 20:28:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:12,759 INFO L225 Difference]: With dead ends: 46 [2020-10-23 20:28:12,759 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 20:28:12,761 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-10-23 20:28:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 20:28:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 20:28:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 20:28:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-23 20:28:12,777 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-10-23 20:28:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:12,778 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-23 20:28:12,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:28:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-23 20:28:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-23 20:28:12,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:12,780 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-10-23 20:28:12,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:28:12,781 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-10-23 20:28:12,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:12,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989750280] [2020-10-23 20:28:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:12,786 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:12,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-23 20:28:13,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989750280] [2020-10-23 20:28:13,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:13,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:28:13,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696533539] [2020-10-23 20:28:13,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:28:13,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:28:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:28:13,097 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-10-23 20:28:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:13,490 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-10-23 20:28:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:28:13,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-10-23 20:28:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:13,493 INFO L225 Difference]: With dead ends: 51 [2020-10-23 20:28:13,493 INFO L226 Difference]: Without dead ends: 44 [2020-10-23 20:28:13,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-23 20:28:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-23 20:28:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-23 20:28:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-10-23 20:28:13,529 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-10-23 20:28:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:13,530 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-23 20:28:13,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:28:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-10-23 20:28:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:28:13,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:13,533 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-10-23 20:28:13,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:28:13,534 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:13,535 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-10-23 20:28:13,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:13,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308184150] [2020-10-23 20:28:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:13,539 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-23 20:28:13,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308184150] [2020-10-23 20:28:13,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:13,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:28:13,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812244737] [2020-10-23 20:28:13,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:28:13,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:28:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:13,773 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-10-23 20:28:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:14,191 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-10-23 20:28:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:28:14,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-10-23 20:28:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:14,194 INFO L225 Difference]: With dead ends: 56 [2020-10-23 20:28:14,195 INFO L226 Difference]: Without dead ends: 49 [2020-10-23 20:28:14,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-23 20:28:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-23 20:28:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 20:28:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-10-23 20:28:14,211 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-10-23 20:28:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:14,211 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-10-23 20:28:14,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:28:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-10-23 20:28:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:28:14,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:14,214 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-10-23 20:28:14,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:28:14,215 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-10-23 20:28:14,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:14,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1270765648] [2020-10-23 20:28:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:14,219 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-23 20:28:14,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1270765648] [2020-10-23 20:28:14,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:14,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:28:14,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001764468] [2020-10-23 20:28:14,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:28:14,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:14,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:28:14,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:28:14,468 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-10-23 20:28:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:14,954 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-23 20:28:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:28:14,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-23 20:28:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:14,957 INFO L225 Difference]: With dead ends: 61 [2020-10-23 20:28:14,958 INFO L226 Difference]: Without dead ends: 54 [2020-10-23 20:28:14,959 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-10-23 20:28:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-23 20:28:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-23 20:28:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-23 20:28:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-10-23 20:28:14,974 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-10-23 20:28:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:14,975 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-10-23 20:28:14,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:28:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-10-23 20:28:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:28:14,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:14,977 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-10-23 20:28:14,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:28:14,978 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-10-23 20:28:14,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:14,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154324511] [2020-10-23 20:28:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:14,983 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-23 20:28:15,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154324511] [2020-10-23 20:28:15,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:15,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:28:15,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869187326] [2020-10-23 20:28:15,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:28:15,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:28:15,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:15,339 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-10-23 20:28:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:15,881 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-10-23 20:28:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:28:15,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-10-23 20:28:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:15,884 INFO L225 Difference]: With dead ends: 66 [2020-10-23 20:28:15,885 INFO L226 Difference]: Without dead ends: 59 [2020-10-23 20:28:15,886 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-10-23 20:28:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-23 20:28:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-23 20:28:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-23 20:28:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-23 20:28:15,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-10-23 20:28:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:15,901 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-23 20:28:15,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:28:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-23 20:28:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:28:15,903 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:15,904 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-10-23 20:28:15,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:28:15,904 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-10-23 20:28:15,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:15,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524617725] [2020-10-23 20:28:15,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:15,911 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-23 20:28:16,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524617725] [2020-10-23 20:28:16,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:16,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:28:16,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635793389] [2020-10-23 20:28:16,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:28:16,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:28:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:28:16,303 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-10-23 20:28:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:16,864 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-10-23 20:28:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:28:16,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-10-23 20:28:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:16,867 INFO L225 Difference]: With dead ends: 71 [2020-10-23 20:28:16,867 INFO L226 Difference]: Without dead ends: 64 [2020-10-23 20:28:16,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-23 20:28:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-23 20:28:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-23 20:28:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-10-23 20:28:16,887 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-10-23 20:28:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:16,887 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-10-23 20:28:16,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:28:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-10-23 20:28:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-23 20:28:16,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:16,890 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-10-23 20:28:16,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:28:16,890 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-10-23 20:28:16,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:16,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1672188809] [2020-10-23 20:28:16,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:16,897 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-23 20:28:17,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1672188809] [2020-10-23 20:28:17,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:17,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:28:17,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662243891] [2020-10-23 20:28:17,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:28:17,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:28:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:17,235 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-10-23 20:28:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:17,893 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-10-23 20:28:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:28:17,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-10-23 20:28:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:17,895 INFO L225 Difference]: With dead ends: 76 [2020-10-23 20:28:17,896 INFO L226 Difference]: Without dead ends: 69 [2020-10-23 20:28:17,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:28:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-23 20:28:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-23 20:28:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-23 20:28:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-10-23 20:28:17,912 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-10-23 20:28:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:17,913 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-10-23 20:28:17,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:28:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-10-23 20:28:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-23 20:28:17,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:17,915 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-10-23 20:28:17,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:28:17,915 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-10-23 20:28:17,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:17,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341921287] [2020-10-23 20:28:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:17,922 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-23 20:28:18,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341921287] [2020-10-23 20:28:18,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:18,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:28:18,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640910208] [2020-10-23 20:28:18,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:28:18,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:18,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:28:18,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:28:18,401 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-10-23 20:28:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:19,055 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-23 20:28:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:28:19,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-10-23 20:28:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:19,057 INFO L225 Difference]: With dead ends: 81 [2020-10-23 20:28:19,057 INFO L226 Difference]: Without dead ends: 74 [2020-10-23 20:28:19,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:28:19,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-23 20:28:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-23 20:28:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-23 20:28:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-10-23 20:28:19,090 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-10-23 20:28:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:19,091 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-10-23 20:28:19,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:28:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-10-23 20:28:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-23 20:28:19,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:19,094 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-10-23 20:28:19,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:28:19,095 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-10-23 20:28:19,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:19,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [337912487] [2020-10-23 20:28:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:19,104 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-23 20:28:19,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [337912487] [2020-10-23 20:28:19,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:19,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:28:19,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300507992] [2020-10-23 20:28:19,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:28:19,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:28:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:19,625 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-10-23 20:28:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:20,341 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-10-23 20:28:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:28:20,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-10-23 20:28:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:20,343 INFO L225 Difference]: With dead ends: 86 [2020-10-23 20:28:20,343 INFO L226 Difference]: Without dead ends: 79 [2020-10-23 20:28:20,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:28:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-23 20:28:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-23 20:28:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-23 20:28:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-23 20:28:20,379 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-10-23 20:28:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:20,380 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-23 20:28:20,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:28:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-23 20:28:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-23 20:28:20,382 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:20,382 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-10-23 20:28:20,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:28:20,382 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-10-23 20:28:20,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:20,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978658850] [2020-10-23 20:28:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:20,394 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2020-10-23 20:28:21,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978658850] [2020-10-23 20:28:21,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:21,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2020-10-23 20:28:21,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600632036] [2020-10-23 20:28:21,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-10-23 20:28:21,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-10-23 20:28:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2020-10-23 20:28:21,869 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 32 states. [2020-10-23 20:28:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:26,763 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-23 20:28:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-10-23 20:28:26,764 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 117 [2020-10-23 20:28:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:26,765 INFO L225 Difference]: With dead ends: 79 [2020-10-23 20:28:26,765 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:28:26,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=965, Invalid=4147, Unknown=0, NotChecked=0, Total=5112 [2020-10-23 20:28:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:28:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:28:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:28:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:28:26,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2020-10-23 20:28:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:26,772 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:28:26,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-10-23 20:28:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:28:26,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:28:26,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:28:26,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:28:27,965 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2020-10-23 20:28:28,828 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2020-10-23 20:28:29,569 WARN L193 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2020-10-23 20:28:30,376 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-10-23 20:28:31,092 WARN L193 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-10-23 20:28:31,261 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,261 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,261 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,262 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,263 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:28:31,263 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,263 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:28:31,263 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,263 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,263 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,264 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,264 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:28:31,264 INFO L270 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 9)) (and .cse3 (<= (+ |sum_#in~m| 10) |sum_#res|))))) [2020-10-23 20:28:31,266 INFO L270 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-10-23 20:28:31,267 INFO L270 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|)))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2)))) [2020-10-23 20:28:31,267 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-10-23 20:28:31,267 INFO L270 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and .cse0 (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|)))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2)))) [2020-10-23 20:28:31,267 INFO L270 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-10-23 20:28:31,268 INFO L270 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (let ((.cse14 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse2 (= sum_~m |sum_#in~m|)) (.cse3 (<= |sum_#res| .cse14)) (.cse4 (<= |sum_#t~ret7| .cse14))) (or (let ((.cse1 (+ |sum_#in~m| 1))) (and .cse0 (<= .cse1 |sum_#t~ret7|) (<= .cse1 |sum_#res|) .cse2 (<= |sum_#in~n| 1) .cse3 .cse4)) (let ((.cse5 (+ |sum_#in~m| 7))) (and .cse0 .cse2 (<= .cse5 |sum_#res|) (<= |sum_#in~n| 7) .cse3 (<= .cse5 |sum_#t~ret7|) .cse4)) (let ((.cse6 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse6 |sum_#res|) .cse2 .cse3 (<= .cse6 |sum_#t~ret7|) .cse4)) (let ((.cse7 (+ |sum_#in~m| 8))) (and .cse0 .cse2 (<= |sum_#in~n| 8) .cse3 (<= .cse7 |sum_#res|) (<= .cse7 |sum_#t~ret7|) .cse4)) (let ((.cse8 (+ |sum_#in~m| 4))) (and .cse0 (<= .cse8 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse2 .cse3 (<= .cse8 |sum_#res|) .cse4)) (let ((.cse9 (+ |sum_#in~m| 6))) (and .cse0 (<= .cse9 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 6) (<= .cse9 |sum_#t~ret7|) .cse4)) (let ((.cse10 (+ |sum_#in~m| 5))) (and .cse0 (<= |sum_#in~n| 5) .cse2 .cse3 (<= .cse10 |sum_#t~ret7|) (<= .cse10 |sum_#res|) .cse4)) (let ((.cse11 (+ |sum_#in~m| 3))) (and .cse0 (<= .cse11 |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 3) .cse3 (<= .cse11 |sum_#res|) .cse4)) (let ((.cse12 (+ |sum_#in~m| 2))) (and .cse0 (<= .cse12 |sum_#res|) (<= |sum_#in~n| 2) .cse2 .cse3 .cse4 (<= .cse12 |sum_#t~ret7|))) (let ((.cse13 (+ |sum_#in~m| 9))) (and .cse0 .cse2 .cse3 (<= .cse13 |sum_#res|) (<= .cse13 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse4))))) [2020-10-23 20:28:31,268 INFO L270 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-10-23 20:28:31,268 INFO L270 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 9)) (and .cse3 (<= (+ |sum_#in~m| 10) |sum_#res|))))) [2020-10-23 20:28:31,268 INFO L277 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-10-23 20:28:31,268 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-10-23 20:28:31,269 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 10 main_~a~0) [2020-10-23 20:28:31,269 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-10-23 20:28:31,269 INFO L270 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 10) (<= main_~a~0 main_~result~0) (<= 10 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:28:31,269 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-10-23 20:28:31,269 INFO L270 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= 10 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:28:31,269 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 10) (<= 10 main_~a~0)) [2020-10-23 20:28:31,270 INFO L270 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= |main_#t~ret8| main_~a~0) (<= 10 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0)) [2020-10-23 20:28:31,270 INFO L270 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 10 main_~a~0) [2020-10-23 20:28:31,270 INFO L270 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= |main_#t~ret8| main_~a~0) (<= 10 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0)) [2020-10-23 20:28:31,270 INFO L270 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= main_~a~0 10) (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= 10 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:28:31,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:28:31 BoogieIcfgContainer [2020-10-23 20:28:31,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:28:31,305 INFO L168 Benchmark]: Toolchain (without parser) took 21428.94 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 135.2 MB in the beginning and 144.2 MB in the end (delta: -9.0 MB). Peak memory consumption was 190.2 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:31,306 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:28:31,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.73 ms. Allocated memory is still 151.0 MB. Free memory was 134.6 MB in the beginning and 125.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:31,307 INFO L168 Benchmark]: Boogie Preprocessor took 49.04 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 123.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:31,307 INFO L168 Benchmark]: RCFGBuilder took 614.31 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.0 MB in the end (delta: 688.7 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:31,308 INFO L168 Benchmark]: TraceAbstraction took 20519.79 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 122.7 MB in the beginning and 144.2 MB in the end (delta: -21.5 MB). Peak memory consumption was 179.5 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:31,311 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 227.73 ms. Allocated memory is still 151.0 MB. Free memory was 134.6 MB in the beginning and 125.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.04 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 123.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 614.31 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.0 MB in the end (delta: 688.7 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20519.79 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 122.7 MB in the beginning and 144.2 MB in the end (delta: -21.5 MB). Peak memory consumption was 179.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum: ((((((((((((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m))) || ((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((m == \old(m) && \old(n) <= 8) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \result)) && ((n == \old(n) && \old(n) <= 9) || (n == \old(n) && \old(m) + 10 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 10 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.9s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 313 SDtfs, 719 SDslu, 718 SDs, 0 SdLazy, 1568 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 9.1s 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 89 PreInvPairs, 239 NumberOfFragments, 1173 HoareAnnotationTreeSize, 89 FomulaSimplifications, 2948 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 39 FomulaSimplificationsInter, 4585 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...