/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:42:11,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:42:11,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:42:11,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:42:11,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:42:11,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:42:11,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:42:11,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:42:11,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:42:11,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:42:11,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:42:11,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:42:11,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:42:11,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:42:11,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:42:11,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:42:11,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:42:11,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:42:11,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:42:11,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:42:11,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:42:11,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:42:11,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:42:11,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:42:11,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:42:11,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:42:11,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:42:11,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:42:11,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:42:11,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:42:11,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:42:11,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:42:11,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:42:11,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:42:11,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:42:11,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:42:11,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:42:11,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:42:11,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:42:11,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:42:11,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:42:11,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:42:11,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:42:11,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:42:11,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:42:11,392 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:42:11,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:42:11,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:42:11,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:42:11,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:42:11,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:42:11,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:42:11,394 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:42:11,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:42:11,395 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:42:11,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:42:11,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:42:11,395 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:42:11,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:42:11,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:42:11,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:42:11,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:42:11,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:42:11,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:42:11,397 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:42:11,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:42:11,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:42:11,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:42:11,854 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:42:11,855 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:42:11,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-11-07 00:42:11,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f92002a/51231d924315455489407a04c9f8a400/FLAG13a2757a9 [2020-11-07 00:42:12,650 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:42:12,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-2.c [2020-11-07 00:42:12,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f92002a/51231d924315455489407a04c9f8a400/FLAG13a2757a9 [2020-11-07 00:42:13,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f92002a/51231d924315455489407a04c9f8a400 [2020-11-07 00:42:13,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:42:13,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:42:13,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:42:13,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:42:13,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:42:13,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5034e69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13, skipping insertion in model container [2020-11-07 00:42:13,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:42:13,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:42:13,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:42:13,270 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:42:13,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:42:13,306 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:42:13,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13 WrapperNode [2020-11-07 00:42:13,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:42:13,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:42:13,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:42:13,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:42:13,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... [2020-11-07 00:42:13,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:42:13,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:42:13,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:42:13,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:42:13,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:42:13,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:42:13,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:42:13,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:42:13,430 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:42:13,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:42:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:42:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:42:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:42:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:42:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:42:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:42:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:42:13,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:42:13,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:42:13,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:42:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:42:13,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:42:13,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:42:13,921 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:42:13,923 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:42:13,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:13 BoogieIcfgContainer [2020-11-07 00:42:13,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:42:13,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:42:13,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:42:13,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:42:13,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:13" (1/3) ... [2020-11-07 00:42:13,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5543e3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:13, skipping insertion in model container [2020-11-07 00:42:13,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:13" (2/3) ... [2020-11-07 00:42:13,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5543e3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:13, skipping insertion in model container [2020-11-07 00:42:13,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:13" (3/3) ... [2020-11-07 00:42:13,957 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2020-11-07 00:42:13,978 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:42:13,982 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:42:13,998 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:42:14,043 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:42:14,043 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:42:14,043 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:42:14,043 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:42:14,044 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:42:14,044 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:42:14,044 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:42:14,044 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:42:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 00:42:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:42:14,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:14,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:14,084 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 00:42:14,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:14,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827991594] [2020-11-07 00:42:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:14,207 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:42:14,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827991594] [2020-11-07 00:42:14,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:14,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:42:14,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399984649] [2020-11-07 00:42:14,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:42:14,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:42:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:42:14,598 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 00:42:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:15,158 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:42:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:42:15,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:42:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:15,174 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:42:15,174 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 00:42:15,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:42:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 00:42:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 00:42:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 00:42:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 00:42:15,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 00:42:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:15,245 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 00:42:15,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:42:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 00:42:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:42:15,248 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:15,249 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:15,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:42:15,249 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 00:42:15,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:15,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [490515104] [2020-11-07 00:42:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:15,255 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:42:15,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [490515104] [2020-11-07 00:42:15,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:15,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:42:15,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007812684] [2020-11-07 00:42:15,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:42:15,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:42:15,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:42:15,539 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 00:42:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:16,052 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 00:42:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:42:16,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 00:42:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:16,055 INFO L225 Difference]: With dead ends: 44 [2020-11-07 00:42:16,055 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:42:16,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:42:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:42:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:42:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:42:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 00:42:16,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 00:42:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:16,087 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 00:42:16,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:42:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 00:42:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 00:42:16,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:16,089 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:16,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:42:16,090 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 00:42:16,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:16,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884633705] [2020-11-07 00:42:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:16,095 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 00:42:16,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884633705] [2020-11-07 00:42:16,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:16,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:42:16,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629976709] [2020-11-07 00:42:16,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:42:16,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:42:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:42:16,333 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 00:42:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:16,815 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 00:42:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:42:16,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 00:42:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:16,817 INFO L225 Difference]: With dead ends: 49 [2020-11-07 00:42:16,818 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:42:16,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:42:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 00:42:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 00:42:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 00:42:16,835 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 00:42:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:16,835 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 00:42:16,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:42:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 00:42:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 00:42:16,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:16,838 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:16,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:42:16,838 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 00:42:16,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:16,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022255520] [2020-11-07 00:42:16,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:16,843 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 00:42:17,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022255520] [2020-11-07 00:42:17,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:17,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:42:17,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571395532] [2020-11-07 00:42:17,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:42:17,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:17,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:42:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:42:17,148 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 00:42:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:17,781 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 00:42:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:42:17,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 00:42:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:17,784 INFO L225 Difference]: With dead ends: 54 [2020-11-07 00:42:17,784 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 00:42:17,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:42:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 00:42:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 00:42:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 00:42:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 00:42:17,801 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 00:42:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:17,801 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 00:42:17,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:42:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 00:42:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:42:17,804 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:17,804 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:17,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:42:17,805 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 00:42:17,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:17,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162567354] [2020-11-07 00:42:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:17,809 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 00:42:18,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162567354] [2020-11-07 00:42:18,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:18,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:42:18,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928472095] [2020-11-07 00:42:18,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:42:18,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:42:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:42:18,142 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 00:42:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:18,864 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 00:42:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:42:18,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 00:42:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:18,867 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:42:18,867 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:42:18,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:42:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:42:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:42:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:42:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 00:42:18,885 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 00:42:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:18,885 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 00:42:18,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:42:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 00:42:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:42:18,888 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:18,888 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:18,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:42:18,888 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 00:42:18,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:18,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861649127] [2020-11-07 00:42:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:18,893 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 00:42:19,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861649127] [2020-11-07 00:42:19,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:19,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:42:19,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168093059] [2020-11-07 00:42:19,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:42:19,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:19,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:42:19,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:42:19,243 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 00:42:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:20,019 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 00:42:20,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:42:20,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 00:42:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:20,024 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:42:20,024 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 00:42:20,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:42:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 00:42:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 00:42:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:42:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 00:42:20,046 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 00:42:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:20,047 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 00:42:20,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:42:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 00:42:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:42:20,049 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:20,049 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:20,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:42:20,050 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 00:42:20,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:20,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1823320325] [2020-11-07 00:42:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:20,054 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 00:42:20,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1823320325] [2020-11-07 00:42:20,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:20,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:42:20,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953213054] [2020-11-07 00:42:20,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:42:20,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:42:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:42:20,418 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 00:42:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:21,327 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 00:42:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:42:21,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 00:42:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:21,334 INFO L225 Difference]: With dead ends: 69 [2020-11-07 00:42:21,334 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 00:42:21,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:42:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 00:42:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 00:42:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:42:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 00:42:21,352 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 00:42:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:21,352 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 00:42:21,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:42:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 00:42:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:42:21,354 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:21,355 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:21,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:42:21,355 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 00:42:21,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:21,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290657274] [2020-11-07 00:42:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:21,359 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 00:42:21,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [290657274] [2020-11-07 00:42:21,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:21,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:42:21,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324310854] [2020-11-07 00:42:21,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:42:21,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:42:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:21,755 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 00:42:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:22,685 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 00:42:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:42:22,686 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 00:42:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:22,688 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:42:22,688 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 00:42:22,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:42:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 00:42:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 00:42:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 00:42:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 00:42:22,720 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 00:42:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:22,722 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 00:42:22,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:42:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 00:42:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 00:42:22,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:22,726 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:22,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:42:22,727 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 00:42:22,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:22,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677340228] [2020-11-07 00:42:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:22,738 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 00:42:23,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677340228] [2020-11-07 00:42:23,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:23,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:42:23,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842797937] [2020-11-07 00:42:23,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:42:23,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:23,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:42:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:42:23,256 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 00:42:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:24,267 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 00:42:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:42:24,268 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 00:42:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:24,270 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:42:24,270 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 00:42:24,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:42:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 00:42:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 00:42:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 00:42:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 00:42:24,286 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 00:42:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:24,286 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 00:42:24,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:42:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 00:42:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:42:24,288 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:24,289 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:24,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:42:24,289 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 00:42:24,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:24,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528956108] [2020-11-07 00:42:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:24,292 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 00:42:24,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528956108] [2020-11-07 00:42:24,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:24,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:42:24,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071349545] [2020-11-07 00:42:24,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:42:24,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:42:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:42:24,772 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 00:42:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:25,871 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 00:42:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:42:25,871 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 00:42:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:25,873 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:42:25,873 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:42:25,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:42:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:42:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 00:42:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 00:42:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 00:42:25,890 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 00:42:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:25,891 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 00:42:25,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:42:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 00:42:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 00:42:25,892 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:25,892 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:25,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:42:25,893 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 00:42:25,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:25,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1208736555] [2020-11-07 00:42:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:25,897 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 00:42:26,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1208736555] [2020-11-07 00:42:26,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:26,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:42:26,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609383482] [2020-11-07 00:42:26,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:42:26,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:42:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:42:26,509 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-11-07 00:42:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:27,719 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 00:42:27,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:42:27,720 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 00:42:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:27,721 INFO L225 Difference]: With dead ends: 89 [2020-11-07 00:42:27,721 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 00:42:27,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:42:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 00:42:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 00:42:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 00:42:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 00:42:27,746 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 00:42:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:27,746 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 00:42:27,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:42:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 00:42:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 00:42:27,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:27,749 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:27,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:42:27,749 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 00:42:27,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:27,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539127902] [2020-11-07 00:42:27,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:27,756 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 00:42:28,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539127902] [2020-11-07 00:42:28,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:28,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:42:28,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221075379] [2020-11-07 00:42:28,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:42:28,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:42:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:42:28,477 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 00:42:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:29,719 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-07 00:42:29,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:42:29,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 00:42:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:29,721 INFO L225 Difference]: With dead ends: 94 [2020-11-07 00:42:29,721 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:42:29,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:42:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:42:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 00:42:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 00:42:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 00:42:29,741 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-11-07 00:42:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:29,741 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 00:42:29,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:42:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 00:42:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 00:42:29,743 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:29,743 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:29,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:42:29,744 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-11-07 00:42:29,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:29,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476612369] [2020-11-07 00:42:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:29,753 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 00:42:30,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476612369] [2020-11-07 00:42:30,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:30,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:42:30,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969997267] [2020-11-07 00:42:30,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:42:30,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:42:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:42:30,546 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-11-07 00:42:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:31,987 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-11-07 00:42:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:42:31,987 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-11-07 00:42:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:31,990 INFO L225 Difference]: With dead ends: 99 [2020-11-07 00:42:31,990 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 00:42:31,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:42:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 00:42:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 00:42:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 00:42:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-11-07 00:42:32,014 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-11-07 00:42:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:32,015 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-11-07 00:42:32,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:42:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-11-07 00:42:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 00:42:32,019 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:32,019 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:32,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:42:32,020 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:32,020 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-11-07 00:42:32,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:32,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939297672] [2020-11-07 00:42:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:32,035 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 00:42:32,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939297672] [2020-11-07 00:42:32,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:32,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:42:32,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513044901] [2020-11-07 00:42:32,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:42:32,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:42:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:42:32,888 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-11-07 00:42:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:34,392 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 00:42:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:42:34,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-11-07 00:42:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:34,395 INFO L225 Difference]: With dead ends: 104 [2020-11-07 00:42:34,395 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 00:42:34,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:42:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 00:42:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-07 00:42:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 00:42:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 00:42:34,418 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-11-07 00:42:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:34,418 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 00:42:34,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:42:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 00:42:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 00:42:34,420 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:34,421 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:34,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:42:34,421 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-11-07 00:42:34,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:34,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223915946] [2020-11-07 00:42:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:34,424 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:34,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 00:42:35,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223915946] [2020-11-07 00:42:35,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:35,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:42:35,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157111287] [2020-11-07 00:42:35,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:42:35,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:35,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:42:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:42:35,286 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-11-07 00:42:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:36,951 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-11-07 00:42:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:42:36,953 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-11-07 00:42:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:36,954 INFO L225 Difference]: With dead ends: 109 [2020-11-07 00:42:36,954 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 00:42:36,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 00:42:36,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 00:42:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-07 00:42:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 00:42:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-11-07 00:42:36,969 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-11-07 00:42:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:36,970 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-11-07 00:42:36,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:42:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-11-07 00:42:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 00:42:36,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:36,972 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:36,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:42:36,973 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-11-07 00:42:36,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:36,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592640147] [2020-11-07 00:42:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:36,976 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 00:42:37,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592640147] [2020-11-07 00:42:37,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:37,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:42:37,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977821425] [2020-11-07 00:42:37,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:42:37,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:42:37,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:42:37,880 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-11-07 00:42:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:39,672 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-11-07 00:42:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:42:39,673 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-11-07 00:42:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:39,676 INFO L225 Difference]: With dead ends: 114 [2020-11-07 00:42:39,676 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 00:42:39,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 00:42:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 00:42:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-07 00:42:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 00:42:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 00:42:39,691 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-11-07 00:42:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:39,692 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 00:42:39,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:42:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 00:42:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 00:42:39,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:39,694 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:39,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:42:39,694 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:39,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-11-07 00:42:39,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:39,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204946117] [2020-11-07 00:42:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:39,697 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:39,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:39,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:39,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:39,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:39,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:39,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 00:42:40,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204946117] [2020-11-07 00:42:40,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:40,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-11-07 00:42:40,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296741368] [2020-11-07 00:42:40,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 00:42:40,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:40,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 00:42:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:42:40,716 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-11-07 00:42:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:42,595 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-11-07 00:42:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:42:42,601 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-11-07 00:42:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:42,602 INFO L225 Difference]: With dead ends: 119 [2020-11-07 00:42:42,602 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 00:42:42,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 00:42:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 00:42:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 00:42:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 00:42:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-11-07 00:42:42,617 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-11-07 00:42:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:42,618 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-11-07 00:42:42,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 00:42:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-11-07 00:42:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-07 00:42:42,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:42,619 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:42,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:42:42,620 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-11-07 00:42:42,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:42,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [560928286] [2020-11-07 00:42:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:42,623 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:42,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 00:42:43,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [560928286] [2020-11-07 00:42:43,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:43,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:42:43,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490568800] [2020-11-07 00:42:43,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:42:43,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:42:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:42:43,928 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-11-07 00:42:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:45,909 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-11-07 00:42:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:42:45,915 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-11-07 00:42:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:45,916 INFO L225 Difference]: With dead ends: 124 [2020-11-07 00:42:45,916 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 00:42:45,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:42:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 00:42:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-11-07 00:42:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 00:42:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 00:42:45,934 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-11-07 00:42:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:45,935 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 00:42:45,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:42:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 00:42:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 00:42:45,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:45,938 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:45,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:42:45,938 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-11-07 00:42:45,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:45,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88699675] [2020-11-07 00:42:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:45,943 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:46,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 00:42:47,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88699675] [2020-11-07 00:42:47,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:47,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:42:47,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277947605] [2020-11-07 00:42:47,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:42:47,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:42:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:42:47,276 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-11-07 00:42:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:49,343 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 00:42:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:42:49,345 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-11-07 00:42:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:49,347 INFO L225 Difference]: With dead ends: 129 [2020-11-07 00:42:49,347 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 00:42:49,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 00:42:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 00:42:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-07 00:42:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 00:42:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-11-07 00:42:49,363 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-11-07 00:42:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:49,363 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-11-07 00:42:49,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:42:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-11-07 00:42:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-07 00:42:49,365 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:49,365 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:49,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 00:42:49,365 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-11-07 00:42:49,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:49,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147732538] [2020-11-07 00:42:49,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:49,369 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:49,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 00:42:50,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147732538] [2020-11-07 00:42:50,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:50,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-07 00:42:50,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124740353] [2020-11-07 00:42:50,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 00:42:50,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:50,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 00:42:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:42:50,705 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-11-07 00:42:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:52,901 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-11-07 00:42:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 00:42:52,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-11-07 00:42:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:52,905 INFO L225 Difference]: With dead ends: 134 [2020-11-07 00:42:52,905 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 00:42:52,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 00:42:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 00:42:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 00:42:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 00:42:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 00:42:52,922 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-11-07 00:42:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:52,923 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 00:42:52,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 00:42:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 00:42:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 00:42:52,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:52,925 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 00:42:52,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 00:42:52,925 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-11-07 00:42:52,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:52,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548487509] [2020-11-07 00:42:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:52,928 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:53,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:54,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:54,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-11-07 00:42:54,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548487509] [2020-11-07 00:42:54,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:54,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-11-07 00:42:54,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612630837] [2020-11-07 00:42:54,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 00:42:54,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 00:42:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:42:54,357 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 26 states. [2020-11-07 00:42:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:56,683 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-11-07 00:42:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 00:42:56,684 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2020-11-07 00:42:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:56,686 INFO L225 Difference]: With dead ends: 139 [2020-11-07 00:42:56,686 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 00:42:56,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=813, Invalid=1539, Unknown=0, NotChecked=0, Total=2352 [2020-11-07 00:42:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 00:42:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-07 00:42:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 00:42:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-11-07 00:42:56,705 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-11-07 00:42:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:56,706 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-11-07 00:42:56,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 00:42:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-11-07 00:42:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-07 00:42:56,707 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:56,708 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:56,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 00:42:56,708 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-11-07 00:42:56,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:56,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632545162] [2020-11-07 00:42:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:56,711 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:56,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:56,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:56,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:56,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:57,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-11-07 00:42:58,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632545162] [2020-11-07 00:42:58,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:58,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-11-07 00:42:58,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860198452] [2020-11-07 00:42:58,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 00:42:58,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 00:42:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:42:58,249 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-11-07 00:43:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:00,704 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-11-07 00:43:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:43:00,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-11-07 00:43:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:00,710 INFO L225 Difference]: With dead ends: 144 [2020-11-07 00:43:00,710 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 00:43:00,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 00:43:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 00:43:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-07 00:43:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 00:43:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-11-07 00:43:00,730 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 193 [2020-11-07 00:43:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:00,730 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-11-07 00:43:00,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 00:43:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-11-07 00:43:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-07 00:43:00,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:00,732 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 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:00,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 00:43:00,733 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1769896713, now seen corresponding path program 22 times [2020-11-07 00:43:00,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:00,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743399923] [2020-11-07 00:43:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:00,736 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:00,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:00,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:43:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:00,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:00,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:01,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:02,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:02,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-11-07 00:43:02,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743399923] [2020-11-07 00:43:02,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:02,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-11-07 00:43:02,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891663905] [2020-11-07 00:43:02,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 00:43:02,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 00:43:02,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-11-07 00:43:02,429 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 28 states. [2020-11-07 00:43:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:05,024 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-11-07 00:43:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:43:05,025 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2020-11-07 00:43:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:05,027 INFO L225 Difference]: With dead ends: 149 [2020-11-07 00:43:05,027 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 00:43:05,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-11-07 00:43:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 00:43:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-07 00:43:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 00:43:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2020-11-07 00:43:05,045 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 201 [2020-11-07 00:43:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:05,046 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2020-11-07 00:43:05,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 00:43:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2020-11-07 00:43:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-11-07 00:43:05,047 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:05,047 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 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:05,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 00:43:05,047 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2013305389, now seen corresponding path program 23 times [2020-11-07 00:43:05,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:05,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [117162042] [2020-11-07 00:43:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:05,051 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:43:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:05,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-11-07 00:43:06,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [117162042] [2020-11-07 00:43:06,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:06,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-11-07 00:43:06,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820498175] [2020-11-07 00:43:06,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 00:43:06,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 00:43:06,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:43:06,808 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 29 states. [2020-11-07 00:43:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:09,531 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-11-07 00:43:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 00:43:09,532 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2020-11-07 00:43:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:09,534 INFO L225 Difference]: With dead ends: 154 [2020-11-07 00:43:09,534 INFO L226 Difference]: Without dead ends: 147 [2020-11-07 00:43:09,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-11-07 00:43:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-07 00:43:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-11-07 00:43:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-07 00:43:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-11-07 00:43:09,558 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 209 [2020-11-07 00:43:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:09,558 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-11-07 00:43:09,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 00:43:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-11-07 00:43:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-11-07 00:43:09,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:09,560 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 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:09,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 00:43:09,561 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash -405782711, now seen corresponding path program 24 times [2020-11-07 00:43:09,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:09,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475207438] [2020-11-07 00:43:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:09,565 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:43:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:09,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:10,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:43:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-11-07 00:43:11,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475207438] [2020-11-07 00:43:11,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:11,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-11-07 00:43:11,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846712645] [2020-11-07 00:43:11,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 00:43:11,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 00:43:11,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:43:11,652 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 30 states. [2020-11-07 00:43:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:14,518 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2020-11-07 00:43:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 00:43:14,519 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2020-11-07 00:43:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:14,522 INFO L225 Difference]: With dead ends: 159 [2020-11-07 00:43:14,522 INFO L226 Difference]: Without dead ends: 152 [2020-11-07 00:43:14,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-11-07 00:43:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-07 00:43:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-11-07 00:43:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-07 00:43:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2020-11-07 00:43:14,543 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 217 [2020-11-07 00:43:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:14,543 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2020-11-07 00:43:14,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 00:43:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2020-11-07 00:43:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-07 00:43:14,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:14,545 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 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:14,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 00:43:14,545 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2086570605, now seen corresponding path program 25 times [2020-11-07 00:43:14,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:14,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [335922001] [2020-11-07 00:43:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:14,549 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:43:14,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:43:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:43:14,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:43:14,737 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:43:14,737 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:43:14,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 00:43:14,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:43:14 BoogieIcfgContainer [2020-11-07 00:43:14,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:43:14,772 INFO L168 Benchmark]: Toolchain (without parser) took 61759.41 ms. Allocated memory was 155.2 MB in the beginning and 467.7 MB in the end (delta: 312.5 MB). Free memory was 132.2 MB in the beginning and 265.5 MB in the end (delta: -133.4 MB). Peak memory consumption was 180.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:14,773 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 125.8 MB. Free memory was 96.3 MB in the beginning and 96.3 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:43:14,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.82 ms. Allocated memory is still 155.2 MB. Free memory was 131.5 MB in the beginning and 122.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:14,774 INFO L168 Benchmark]: Boogie Preprocessor took 35.09 ms. Allocated memory is still 155.2 MB. Free memory was 122.5 MB in the beginning and 121.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:14,774 INFO L168 Benchmark]: RCFGBuilder took 585.19 ms. Allocated memory is still 155.2 MB. Free memory was 121.2 MB in the beginning and 108.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:14,775 INFO L168 Benchmark]: TraceAbstraction took 60822.32 ms. Allocated memory was 155.2 MB in the beginning and 467.7 MB in the end (delta: 312.5 MB). Free memory was 139.1 MB in the beginning and 265.5 MB in the end (delta: -126.4 MB). Peak memory consumption was 186.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:43:14,777 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.25 ms. Allocated memory is still 125.8 MB. Free memory was 96.3 MB in the beginning and 96.3 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 284.82 ms. Allocated memory is still 155.2 MB. Free memory was 131.5 MB in the beginning and 122.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.09 ms. Allocated memory is still 155.2 MB. Free memory was 122.5 MB in the beginning and 121.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 585.19 ms. Allocated memory is still 155.2 MB. Free memory was 121.2 MB in the beginning and 108.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 60822.32 ms. Allocated memory was 155.2 MB in the beginning and 467.7 MB in the end (delta: 312.5 MB). Free memory was 139.1 MB in the beginning and 265.5 MB in the end (delta: -126.4 MB). Peak memory consumption was 186.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 25; [L13] CALL, EXPR id(input) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND TRUE x==0 [L7] return 0; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) [L13] int result = id(input); [L14] COND TRUE result == 25 [L15] CALL reach_error() [L4] __assert_fail("0", "id_i25_o25-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 60.6s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 678 SDtfs, 3123 SDslu, 1646 SDs, 0 SdLazy, 3167 SolverSat, 918 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1477 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 776 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5853 ImplicationChecksByTransitivity, 36.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=25, 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, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...