/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_20x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:43:55,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:43:55,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:43:55,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:43:55,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:43:55,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:43:55,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:43:55,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:43:55,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:43:55,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:43:55,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:43:55,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:43:55,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:43:55,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:43:55,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:43:55,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:43:55,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:43:55,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:43:55,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:43:55,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:43:55,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:43:55,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:43:55,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:43:55,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:43:55,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:43:55,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:43:55,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:43:55,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:43:55,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:43:55,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:43:55,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:43:55,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:43:55,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:43:55,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:43:55,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:43:55,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:43:55,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:43:55,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:43:55,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:43:55,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:43:55,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:43:55,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:43:55,924 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:43:55,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:43:55,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:43:55,926 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:43:55,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:43:55,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:43:55,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:43:55,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:43:55,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:43:55,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:43:55,928 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:43:55,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:43:55,928 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:43:55,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:43:55,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:43:55,929 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:43:55,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:43:55,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:43:55,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:55,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:43:55,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:43:55,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:43:55,931 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:43:56,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:43:56,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:43:56,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:43:56,354 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:43:56,355 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:43:56,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-2.c [2020-11-07 00:43:56,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29031b5f8/b9c93b118a2046f5b1c206cef8e9696b/FLAG45482dca2 [2020-11-07 00:43:57,156 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:43:57,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-2.c [2020-11-07 00:43:57,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29031b5f8/b9c93b118a2046f5b1c206cef8e9696b/FLAG45482dca2 [2020-11-07 00:43:57,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29031b5f8/b9c93b118a2046f5b1c206cef8e9696b [2020-11-07 00:43:57,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:43:57,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:43:57,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:57,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:43:57,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:43:57,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4769f613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57, skipping insertion in model container [2020-11-07 00:43:57,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:43:57,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:43:57,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:57,886 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:43:57,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:57,925 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:43:57,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57 WrapperNode [2020-11-07 00:43:57,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:57,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:43:57,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:43:57,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:43:57,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... [2020-11-07 00:43:57,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:43:57,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:43:57,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:43:57,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:43:57,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:43:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:43:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:43:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 00:43:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:43:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:43:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:43:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:43:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:43:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 00:43:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:43:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:43:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:43:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:43:58,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:43:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:43:58,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:43:58,290 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:43:58,291 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:43:58,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:58 BoogieIcfgContainer [2020-11-07 00:43:58,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:43:58,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:43:58,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:43:58,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:43:58,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:43:57" (1/3) ... [2020-11-07 00:43:58,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d30a724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:58, skipping insertion in model container [2020-11-07 00:43:58,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:57" (2/3) ... [2020-11-07 00:43:58,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d30a724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:58, skipping insertion in model container [2020-11-07 00:43:58,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:58" (3/3) ... [2020-11-07 00:43:58,336 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_20x0-2.c [2020-11-07 00:43:58,357 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:43:58,362 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:43:58,382 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:43:58,413 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:43:58,413 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:43:58,413 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:43:58,414 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:43:58,414 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:43:58,414 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:43:58,414 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:43:58,415 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:43:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 00:43:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:43:58,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:58,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:58,452 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 00:43:58,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:58,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1412666089] [2020-11-07 00:43:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:58,618 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:58,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:43:59,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1412666089] [2020-11-07 00:43:59,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:59,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:43:59,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551960134] [2020-11-07 00:43:59,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:43:59,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:43:59,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:43:59,053 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 00:43:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:59,331 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:43:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:43:59,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:43:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:59,344 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:43:59,344 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 00:43:59,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 00:43:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 00:43:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 00:43:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 00:43:59,406 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 00:43:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:59,407 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 00:43:59,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:43:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 00:43:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:43:59,410 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:59,411 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:59,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:43:59,411 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 00:43:59,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:59,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2096179954] [2020-11-07 00:43:59,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:59,417 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 00:43:59,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2096179954] [2020-11-07 00:43:59,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:59,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:43:59,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276743390] [2020-11-07 00:43:59,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:43:59,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:43:59,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:43:59,675 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 00:43:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:59,919 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 00:43:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:43:59,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 00:43:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:59,921 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:43:59,921 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:43:59,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:43:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:43:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:43:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 00:43:59,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 00:43:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:59,940 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 00:43:59,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:43:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 00:43:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:43:59,944 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:59,944 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:59,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:43:59,944 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:59,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 00:43:59,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:59,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876141562] [2020-11-07 00:43:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:59,951 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:44:00,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876141562] [2020-11-07 00:44:00,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:00,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:44:00,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619142221] [2020-11-07 00:44:00,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:44:00,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:44:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:44:00,164 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 00:44:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:00,469 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 00:44:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:44:00,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 00:44:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:00,471 INFO L225 Difference]: With dead ends: 51 [2020-11-07 00:44:00,472 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 00:44:00,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:44:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 00:44:00,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 00:44:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 00:44:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 00:44:00,486 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 00:44:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:00,487 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 00:44:00,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:44:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 00:44:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:44:00,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:00,489 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:00,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:44:00,490 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 00:44:00,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:00,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326262392] [2020-11-07 00:44:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:00,494 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 00:44:00,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326262392] [2020-11-07 00:44:00,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:00,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:44:00,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108686568] [2020-11-07 00:44:00,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:44:00,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:44:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:44:00,780 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 00:44:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:01,214 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 00:44:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:44:01,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 00:44:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:01,218 INFO L225 Difference]: With dead ends: 56 [2020-11-07 00:44:01,218 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 00:44:01,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:44:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 00:44:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 00:44:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 00:44:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 00:44:01,233 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 00:44:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:01,234 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 00:44:01,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:44:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 00:44:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:44:01,236 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:01,236 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:01,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:44:01,236 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:01,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 00:44:01,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:01,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [689173212] [2020-11-07 00:44:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:01,240 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 00:44:01,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [689173212] [2020-11-07 00:44:01,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:01,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:44:01,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157583297] [2020-11-07 00:44:01,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:44:01,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:44:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:44:01,442 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 00:44:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:01,927 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 00:44:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:44:01,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 00:44:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:01,929 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:44:01,930 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:44:01,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:44:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:44:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:44:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:44:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 00:44:01,944 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 00:44:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:01,945 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 00:44:01,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:44:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 00:44:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:44:01,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:01,947 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:01,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:44:01,947 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 00:44:01,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:01,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1830562688] [2020-11-07 00:44:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:01,951 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 00:44:02,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1830562688] [2020-11-07 00:44:02,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:02,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:44:02,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053930693] [2020-11-07 00:44:02,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:44:02,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:44:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:44:02,165 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 00:44:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:02,757 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 00:44:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:44:02,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 00:44:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:02,759 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:44:02,759 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:44:02,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:44:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:44:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:44:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:44:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 00:44:02,776 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 00:44:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:02,776 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 00:44:02,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:44:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 00:44:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:44:02,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:02,778 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:02,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:44:02,778 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:02,779 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 00:44:02,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:02,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2027947432] [2020-11-07 00:44:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:02,782 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:44:03,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2027947432] [2020-11-07 00:44:03,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:03,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:44:03,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764727580] [2020-11-07 00:44:03,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:44:03,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:03,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:44:03,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:44:03,044 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 00:44:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:03,648 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 00:44:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:44:03,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 00:44:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:03,652 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:44:03,652 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 00:44:03,653 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-11-07 00:44:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 00:44:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 00:44:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 00:44:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 00:44:03,668 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 00:44:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:03,669 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 00:44:03,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:44:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 00:44:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 00:44:03,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:03,671 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:03,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:44:03,671 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:03,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 00:44:03,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:03,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429902896] [2020-11-07 00:44:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:03,674 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 00:44:04,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429902896] [2020-11-07 00:44:04,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:04,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:44:04,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942654317] [2020-11-07 00:44:04,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:44:04,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:04,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:44:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:44:04,012 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 00:44:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:04,667 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 00:44:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:44:04,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 00:44:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:04,669 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:44:04,669 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:44:04,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:44:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:44:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 00:44:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:44:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 00:44:04,708 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 00:44:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:04,709 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 00:44:04,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:44:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 00:44:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:44:04,710 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:04,711 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:04,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:44:04,716 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:04,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 00:44:04,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:04,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1089540294] [2020-11-07 00:44:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:04,723 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 00:44:05,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1089540294] [2020-11-07 00:44:05,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:05,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:44:05,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292494245] [2020-11-07 00:44:05,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:44:05,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:44:05,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:44:05,145 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 00:44:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:05,817 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 00:44:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:44:05,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 00:44:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:05,819 INFO L225 Difference]: With dead ends: 81 [2020-11-07 00:44:05,819 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 00:44:05,821 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-11-07 00:44:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 00:44:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 00:44:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:44:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 00:44:05,861 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 00:44:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:05,863 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 00:44:05,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:44:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 00:44:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:44:05,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:05,868 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:05,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:44:05,868 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 00:44:05,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:05,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127988273] [2020-11-07 00:44:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:05,873 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:44:06,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127988273] [2020-11-07 00:44:06,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:06,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:44:06,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486801772] [2020-11-07 00:44:06,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:44:06,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:44:06,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:44:06,403 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 00:44:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:07,104 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 00:44:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:44:07,104 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 00:44:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:07,106 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:44:07,106 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:44:07,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:44:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:44:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:44:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:44:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 00:44:07,137 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 00:44:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:07,137 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 00:44:07,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:44:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 00:44:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 00:44:07,139 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:07,139 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:07,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:44:07,139 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 00:44:07,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:07,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408926418] [2020-11-07 00:44:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:07,142 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-11-07 00:44:07,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408926418] [2020-11-07 00:44:07,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:07,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:44:07,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11977004] [2020-11-07 00:44:07,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:44:07,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:44:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:44:07,853 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-11-07 00:44:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:08,633 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-11-07 00:44:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:44:08,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-11-07 00:44:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:08,636 INFO L225 Difference]: With dead ends: 91 [2020-11-07 00:44:08,636 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 00:44:08,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:44:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 00:44:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-07 00:44:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 00:44:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-11-07 00:44:08,666 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-11-07 00:44:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:08,667 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-11-07 00:44:08,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:44:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-11-07 00:44:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-07 00:44:08,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:08,670 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:08,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:44:08,673 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:08,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-11-07 00:44:08,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:08,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1949134929] [2020-11-07 00:44:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:08,678 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-11-07 00:44:09,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1949134929] [2020-11-07 00:44:09,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:09,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:44:09,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302242170] [2020-11-07 00:44:09,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:44:09,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:44:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:44:09,371 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-11-07 00:44:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:10,185 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-11-07 00:44:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:44:10,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-11-07 00:44:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:10,187 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:44:10,187 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:44:10,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:44:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:44:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-07 00:44:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-07 00:44:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-11-07 00:44:10,210 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-11-07 00:44:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:10,211 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-11-07 00:44:10,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:44:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-11-07 00:44:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 00:44:10,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:10,214 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:10,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:44:10,214 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-11-07 00:44:10,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:10,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1487210545] [2020-11-07 00:44:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:10,219 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-11-07 00:44:10,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1487210545] [2020-11-07 00:44:10,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:10,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:44:10,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512267773] [2020-11-07 00:44:10,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:44:10,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:10,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:44:10,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:44:10,863 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-11-07 00:44:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:11,717 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-11-07 00:44:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:44:11,718 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-11-07 00:44:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:11,720 INFO L225 Difference]: With dead ends: 101 [2020-11-07 00:44:11,720 INFO L226 Difference]: Without dead ends: 94 [2020-11-07 00:44:11,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:44:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-07 00:44:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-11-07 00:44:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 00:44:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-11-07 00:44:11,747 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-11-07 00:44:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:11,747 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-11-07 00:44:11,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:44:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-11-07 00:44:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 00:44:11,749 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:11,749 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:11,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:44:11,750 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-11-07 00:44:11,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:11,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048079341] [2020-11-07 00:44:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:11,753 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-11-07 00:44:12,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048079341] [2020-11-07 00:44:12,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:12,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:44:12,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413693104] [2020-11-07 00:44:12,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:44:12,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:44:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:44:12,545 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-11-07 00:44:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:13,524 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-11-07 00:44:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:44:13,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-11-07 00:44:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:13,526 INFO L225 Difference]: With dead ends: 106 [2020-11-07 00:44:13,526 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 00:44:13,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:44:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 00:44:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-11-07 00:44:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 00:44:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-11-07 00:44:13,547 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-11-07 00:44:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:13,548 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-11-07 00:44:13,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:44:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-11-07 00:44:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 00:44:13,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:13,562 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:13,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:44:13,562 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-11-07 00:44:13,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:13,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [898779581] [2020-11-07 00:44:13,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:13,567 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-11-07 00:44:14,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [898779581] [2020-11-07 00:44:14,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:14,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:44:14,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47943896] [2020-11-07 00:44:14,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:44:14,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:44:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:44:14,458 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-11-07 00:44:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:15,507 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-11-07 00:44:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:44:15,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-11-07 00:44:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:15,509 INFO L225 Difference]: With dead ends: 111 [2020-11-07 00:44:15,509 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 00:44:15,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 00:44:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 00:44:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-07 00:44:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 00:44:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-11-07 00:44:15,526 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-11-07 00:44:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:15,527 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-11-07 00:44:15,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:44:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-11-07 00:44:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-07 00:44:15,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:15,530 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:15,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:44:15,530 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-11-07 00:44:15,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:15,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [647161978] [2020-11-07 00:44:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:15,533 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-11-07 00:44:16,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [647161978] [2020-11-07 00:44:16,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:16,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:44:16,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111482848] [2020-11-07 00:44:16,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:44:16,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:44:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:44:16,316 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-11-07 00:44:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:17,414 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-11-07 00:44:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:44:17,414 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-11-07 00:44:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:17,416 INFO L225 Difference]: With dead ends: 116 [2020-11-07 00:44:17,416 INFO L226 Difference]: Without dead ends: 109 [2020-11-07 00:44:17,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 00:44:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-07 00:44:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-11-07 00:44:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 00:44:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-11-07 00:44:17,432 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-11-07 00:44:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:17,433 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-11-07 00:44:17,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:44:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-11-07 00:44:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-11-07 00:44:17,435 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:17,435 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:17,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:44:17,436 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-11-07 00:44:17,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:17,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584219994] [2020-11-07 00:44:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:17,439 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:18,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:18,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:18,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-11-07 00:44:18,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584219994] [2020-11-07 00:44:18,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:18,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-11-07 00:44:18,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795145946] [2020-11-07 00:44:18,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 00:44:18,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 00:44:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:44:18,317 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-11-07 00:44:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:19,489 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-11-07 00:44:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:44:19,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-11-07 00:44:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:19,492 INFO L225 Difference]: With dead ends: 121 [2020-11-07 00:44:19,492 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 00:44:19,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 00:44:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 00:44:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-11-07 00:44:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-07 00:44:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-11-07 00:44:19,508 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-11-07 00:44:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:19,508 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-11-07 00:44:19,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 00:44:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-11-07 00:44:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-07 00:44:19,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:19,511 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:19,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:44:19,511 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-11-07 00:44:19,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:19,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284526705] [2020-11-07 00:44:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:19,514 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-11-07 00:44:20,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284526705] [2020-11-07 00:44:20,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:20,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:44:20,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541723527] [2020-11-07 00:44:20,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:44:20,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:44:20,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:44:20,592 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-11-07 00:44:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:21,799 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-11-07 00:44:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:44:21,802 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-11-07 00:44:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:21,804 INFO L225 Difference]: With dead ends: 126 [2020-11-07 00:44:21,804 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 00:44:21,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:44:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 00:44:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-11-07 00:44:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 00:44:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-11-07 00:44:21,825 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-11-07 00:44:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:21,825 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-11-07 00:44:21,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:44:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-11-07 00:44:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 00:44:21,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:21,828 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:21,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:44:21,828 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-11-07 00:44:21,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:21,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1146148896] [2020-11-07 00:44:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:21,834 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-11-07 00:44:22,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1146148896] [2020-11-07 00:44:22,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:22,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:44:22,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809121453] [2020-11-07 00:44:22,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:44:22,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:44:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:44:22,960 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-11-07 00:44:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:24,339 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-11-07 00:44:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:44:24,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-11-07 00:44:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:24,342 INFO L225 Difference]: With dead ends: 131 [2020-11-07 00:44:24,342 INFO L226 Difference]: Without dead ends: 124 [2020-11-07 00:44:24,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 00:44:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-07 00:44:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-11-07 00:44:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:44:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-11-07 00:44:24,359 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-11-07 00:44:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:24,359 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-11-07 00:44:24,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:44:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-11-07 00:44:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-07 00:44:24,361 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:24,361 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:24,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 00:44:24,361 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-11-07 00:44:24,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:24,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269011274] [2020-11-07 00:44:24,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:24,364 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-11-07 00:44:25,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269011274] [2020-11-07 00:44:25,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:25,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-07 00:44:25,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597996669] [2020-11-07 00:44:25,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 00:44:25,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 00:44:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:44:25,557 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-11-07 00:44:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:26,990 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-11-07 00:44:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 00:44:26,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-11-07 00:44:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:26,993 INFO L225 Difference]: With dead ends: 136 [2020-11-07 00:44:26,994 INFO L226 Difference]: Without dead ends: 129 [2020-11-07 00:44:26,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 00:44:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-07 00:44:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-11-07 00:44:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 00:44:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-11-07 00:44:27,012 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-11-07 00:44:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:27,012 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-11-07 00:44:27,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 00:44:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-11-07 00:44:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-07 00:44:27,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:27,014 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:44:27,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 00:44:27,015 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:27,015 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-11-07 00:44:27,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:27,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517003547] [2020-11-07 00:44:27,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:27,018 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2020-11-07 00:44:30,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517003547] [2020-11-07 00:44:30,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:30,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2020-11-07 00:44:30,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036677177] [2020-11-07 00:44:30,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 52 states [2020-11-07 00:44:30,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2020-11-07 00:44:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 00:44:30,544 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 52 states. [2020-11-07 00:44:38,457 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-07 00:44:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:41,450 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 00:44:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-11-07 00:44:41,450 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2020-11-07 00:44:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:41,451 INFO L225 Difference]: With dead ends: 129 [2020-11-07 00:44:41,451 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:44:41,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2930, Invalid=11832, Unknown=0, NotChecked=0, Total=14762 [2020-11-07 00:44:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:44:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:44:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:44:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:44:41,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2020-11-07 00:44:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:41,458 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:44:41,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2020-11-07 00:44:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:44:41,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:44:41,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 00:44:41,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:44:43,692 WARN L194 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 173 DAG size of output: 131 [2020-11-07 00:44:45,005 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 151 DAG size of output: 109 [2020-11-07 00:44:46,243 WARN L194 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 151 DAG size of output: 109 [2020-11-07 00:44:47,909 WARN L194 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2020-11-07 00:44:49,482 WARN L194 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2020-11-07 00:44:49,681 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,682 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,682 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,682 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,682 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,682 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,682 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,683 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,683 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,683 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,683 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:44:49,683 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,683 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:44:49,684 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,684 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,684 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,684 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,684 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:44:49,684 INFO L262 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse0 .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 (<= |sum_#in~n| 14) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 15)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (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|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 19)) (and .cse3 (<= (+ |sum_#in~m| 20) |sum_#res|))))) [2020-11-07 00:44:49,685 INFO L262 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-11-07 00:44:49,685 INFO L262 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 20) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 18) .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= |sum_#in~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-11-07 00:44:49,685 INFO L262 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-11-07 00:44:49,685 INFO L262 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 20) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 18) .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= |sum_#in~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-11-07 00:44:49,686 INFO L262 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-11-07 00:44:49,686 INFO L262 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (let ((.cse24 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse2 (= sum_~m |sum_#in~m|)) (.cse3 (<= |sum_#res| .cse24)) (.cse4 (<= |sum_#t~ret7| .cse24))) (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| 3))) (and .cse0 (<= .cse5 |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 3) .cse3 (<= .cse5 |sum_#res|) .cse4)) (let ((.cse6 (+ |sum_#in~m| 18))) (and .cse0 (<= .cse6 |sum_#res|) (<= .cse6 |sum_#t~ret7|) .cse2 .cse3 (<= |sum_#in~n| 18) .cse4)) (let ((.cse7 (+ |sum_#in~m| 16))) (and .cse0 (<= .cse7 |sum_#res|) .cse2 .cse3 (<= .cse7 |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse4)) (let ((.cse8 (+ |sum_#in~m| 17))) (and .cse0 (<= |sum_#in~n| 17) .cse2 .cse3 (<= .cse8 |sum_#t~ret7|) .cse4 (<= .cse8 |sum_#res|))) (let ((.cse9 (+ |sum_#in~m| 7))) (and .cse0 .cse2 (<= .cse9 |sum_#res|) (<= |sum_#in~n| 7) .cse3 (<= .cse9 |sum_#t~ret7|) .cse4)) (let ((.cse10 (+ |sum_#in~m| 11))) (and .cse0 (<= .cse10 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 11) .cse4 (<= .cse10 |sum_#t~ret7|))) (let ((.cse11 (+ |sum_#in~m| 13))) (and .cse0 .cse2 (<= .cse11 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse3 (<= .cse11 |sum_#res|) .cse4)) (let ((.cse12 (+ |sum_#in~m| 19))) (and .cse0 (<= |sum_#in~n| 19) .cse2 (<= .cse12 |sum_#t~ret7|) .cse3 (<= .cse12 |sum_#res|) .cse4)) (let ((.cse13 (+ |sum_#in~m| 4))) (and .cse0 (<= .cse13 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse2 .cse3 (<= .cse13 |sum_#res|) .cse4)) (let ((.cse14 (+ |sum_#in~m| 8))) (and .cse0 .cse2 (<= |sum_#in~n| 8) .cse3 (<= .cse14 |sum_#res|) (<= .cse14 |sum_#t~ret7|) .cse4)) (let ((.cse15 (+ |sum_#in~m| 12))) (and .cse0 .cse2 .cse3 (<= |sum_#in~n| 12) (<= .cse15 |sum_#t~ret7|) .cse4 (<= .cse15 |sum_#res|))) (let ((.cse16 (+ |sum_#in~m| 6))) (and .cse0 (<= .cse16 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 6) (<= .cse16 |sum_#t~ret7|) .cse4)) (let ((.cse17 (+ |sum_#in~m| 14))) (and .cse0 (<= .cse17 |sum_#t~ret7|) (<= .cse17 |sum_#res|) .cse2 (<= |sum_#in~n| 14) .cse3 .cse4)) (let ((.cse18 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse18 |sum_#res|) .cse2 .cse3 (<= .cse18 |sum_#t~ret7|) .cse4 (<= |sum_#in~n| 10))) (let ((.cse19 (+ |sum_#in~m| 5))) (and .cse0 (<= |sum_#in~n| 5) .cse2 .cse3 (<= .cse19 |sum_#t~ret7|) (<= .cse19 |sum_#res|) .cse4)) (let ((.cse20 (+ |sum_#in~m| 20))) (and .cse0 .cse2 .cse3 (<= .cse20 |sum_#t~ret7|) (<= .cse20 |sum_#res|) .cse4)) (let ((.cse21 (+ |sum_#in~m| 2))) (and .cse0 (<= .cse21 |sum_#res|) (<= |sum_#in~n| 2) .cse2 .cse3 .cse4 (<= .cse21 |sum_#t~ret7|))) (let ((.cse22 (+ |sum_#in~m| 9))) (and .cse0 .cse2 .cse3 (<= .cse22 |sum_#res|) (<= .cse22 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse4)) (let ((.cse23 (+ |sum_#in~m| 15))) (and .cse0 (<= .cse23 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 15) .cse4 (<= .cse23 |sum_#t~ret7|)))))) [2020-11-07 00:44:49,686 INFO L262 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-11-07 00:44:49,686 INFO L262 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse0 .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 (<= |sum_#in~n| 14) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 15)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (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|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 19)) (and .cse3 (<= (+ |sum_#in~m| 20) |sum_#res|))))) [2020-11-07 00:44:49,687 INFO L269 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-11-07 00:44:49,687 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 20 main_~a~0) [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= main_~a~0 20) (<= 20 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~a~0 20) (<= 20 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 20) (<= 20 main_~a~0)) [2020-11-07 00:44:49,687 INFO L262 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 20) (<= main_~a~0 |main_#t~ret8|) (<= 20 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:44:49,688 INFO L262 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 20 main_~a~0) [2020-11-07 00:44:49,688 INFO L262 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 20) (<= main_~a~0 |main_#t~ret8|) (<= 20 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:44:49,688 INFO L262 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= main_~a~0 20) (<= main_~a~0 |main_#t~ret8|) (<= 20 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-11-07 00:44:49,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:44:49 BoogieIcfgContainer [2020-11-07 00:44:49,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:44:49,731 INFO L168 Benchmark]: Toolchain (without parser) took 52171.71 ms. Allocated memory was 154.1 MB in the beginning and 566.2 MB in the end (delta: 412.1 MB). Free memory was 130.5 MB in the beginning and 439.1 MB in the end (delta: -308.5 MB). Peak memory consumption was 336.7 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:49,731 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 154.1 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:44:49,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.12 ms. Allocated memory is still 154.1 MB. Free memory was 129.9 MB in the beginning and 121.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:49,732 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 ms. Allocated memory is still 154.1 MB. Free memory was 120.9 MB in the beginning and 119.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:49,733 INFO L168 Benchmark]: RCFGBuilder took 321.80 ms. Allocated memory is still 154.1 MB. Free memory was 119.7 MB in the beginning and 106.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:49,733 INFO L168 Benchmark]: TraceAbstraction took 51417.72 ms. Allocated memory was 154.1 MB in the beginning and 566.2 MB in the end (delta: 412.1 MB). Free memory was 137.7 MB in the beginning and 439.1 MB in the end (delta: -301.4 MB). Peak memory consumption was 342.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:49,740 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 154.1 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 355.12 ms. Allocated memory is still 154.1 MB. Free memory was 129.9 MB in the beginning and 121.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.88 ms. Allocated memory is still 154.1 MB. Free memory was 120.9 MB in the beginning and 119.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 321.80 ms. Allocated memory is still 154.1 MB. Free memory was 119.7 MB in the beginning and 106.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 51417.72 ms. Allocated memory was 154.1 MB in the beginning and 566.2 MB in the end (delta: 412.1 MB). Free memory was 137.7 MB in the beginning and 439.1 MB in the end (delta: -301.4 MB). Peak memory consumption was 342.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) && \result <= \old(n) + \old(m)) && \old(m) + 19 <= \result) || (((\old(n) <= 17 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 17 <= \result)) || (((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m))) || (((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 16 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 16)) || (((\old(m) + 14 <= \result && m == \old(m)) && \old(n) <= 14) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((\old(m) + 18 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 18)) || (((\old(m) + 15 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 15)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((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)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((m == \old(m) && \old(n) <= 13) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || (((\old(m) + 10 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || (((\old(m) + 11 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 11)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 12) && \old(m) + 12 <= \result)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) && ((n == \old(n) && \old(n) <= 19) || (n == \old(n) && \old(m) + 20 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 20 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43.0s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 26.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 603 SDtfs, 2190 SDslu, 1356 SDs, 0 SdLazy, 3538 SolverSat, 643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5167 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 129 PreInvPairs, 429 NumberOfFragments, 2271 HoareAnnotationTreeSize, 129 FomulaSimplifications, 5998 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 39 FomulaSimplificationsInter, 8387 FormulaSimplificationTreeSizeReductionInter, 7.3s 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...