/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_25x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:56:41,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:56:41,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:56:41,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:56:41,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:56:41,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:56:41,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:56:41,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:56:41,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:56:41,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:56:41,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:56:41,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:56:41,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:56:41,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:56:41,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:56:41,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:56:41,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:56:41,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:56:41,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:56:41,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:56:41,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:56:41,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:56:41,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:56:41,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:56:41,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:56:41,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:56:41,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:56:41,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:56:41,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:56:41,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:56:41,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:56:41,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:56:41,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:56:41,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:56:41,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:56:41,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:56:41,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:56:41,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:56:41,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:56:41,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:56:41,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:56:41,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:56:41,477 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:56:41,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:56:41,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:56:41,479 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:56:41,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:56:41,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:56:41,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:56:41,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:56:41,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:56:41,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:56:41,481 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:56:41,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:56:41,481 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:56:41,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:56:41,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:56:41,482 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:56:41,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:56:41,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:56:41,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:56:41,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:56:41,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:56:41,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:56:41,483 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:56:41,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:56:41,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:56:41,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:56:41,938 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:56:41,939 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:56:41,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-10-24 00:56:42,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5141f02/ff4466f4b321417499a54f1761ccb705/FLAG346fd7194 [2020-10-24 00:56:42,763 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:56:42,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-10-24 00:56:42,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5141f02/ff4466f4b321417499a54f1761ccb705/FLAG346fd7194 [2020-10-24 00:56:43,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5141f02/ff4466f4b321417499a54f1761ccb705 [2020-10-24 00:56:43,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:56:43,140 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:56:43,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:56:43,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:56:43,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:56:43,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dd64bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43, skipping insertion in model container [2020-10-24 00:56:43,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:56:43,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:56:43,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:56:43,346 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:56:43,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:56:43,385 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:56:43,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43 WrapperNode [2020-10-24 00:56:43,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:56:43,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:56:43,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:56:43,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:56:43,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... [2020-10-24 00:56:43,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:56:43,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:56:43,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:56:43,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:56:43,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:56:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:56:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:56:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:56:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-10-24 00:56:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:56:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:56:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:56:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:56:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:56:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-10-24 00:56:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:56:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:56:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:56:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:56:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:56:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:56:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:56:43,798 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:56:43,799 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:56:43,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:56:43 BoogieIcfgContainer [2020-10-24 00:56:43,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:56:43,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:56:43,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:56:43,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:56:43,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:56:43" (1/3) ... [2020-10-24 00:56:43,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49978dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:56:43, skipping insertion in model container [2020-10-24 00:56:43,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:56:43" (2/3) ... [2020-10-24 00:56:43,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49978dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:56:43, skipping insertion in model container [2020-10-24 00:56:43,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:56:43" (3/3) ... [2020-10-24 00:56:43,814 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2020-10-24 00:56:43,831 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:56:43,837 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:56:43,881 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:56:43,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:56:43,968 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:56:43,969 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:56:43,969 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:56:43,969 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:56:43,969 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:56:43,969 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:56:43,970 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:56:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-24 00:56:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-24 00:56:44,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:44,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:44,021 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-10-24 00:56:44,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:44,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034219585] [2020-10-24 00:56:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:44,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:44,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:56:44,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034219585] [2020-10-24 00:56:44,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:56:44,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:56:44,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366142698] [2020-10-24 00:56:44,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:56:44,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:56:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:56:44,552 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-10-24 00:56:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:44,875 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-24 00:56:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:56:44,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-24 00:56:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:44,888 INFO L225 Difference]: With dead ends: 52 [2020-10-24 00:56:44,889 INFO L226 Difference]: Without dead ends: 34 [2020-10-24 00:56:44,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:56:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-24 00:56:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-24 00:56:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-24 00:56:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-10-24 00:56:44,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-10-24 00:56:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:44,966 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-24 00:56:44,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:56:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-10-24 00:56:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-24 00:56:44,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:44,972 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:44,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:56:44,973 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-10-24 00:56:44,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:44,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125088566] [2020-10-24 00:56:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-24 00:56:45,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [125088566] [2020-10-24 00:56:45,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:45,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:56:45,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554866182] [2020-10-24 00:56:45,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:56:45,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:56:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:56:45,203 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-10-24 00:56:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:45,462 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-10-24 00:56:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:56:45,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-10-24 00:56:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:45,464 INFO L225 Difference]: With dead ends: 46 [2020-10-24 00:56:45,465 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:56:45,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:56:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:56:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:56:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:56:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-24 00:56:45,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-10-24 00:56:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:45,482 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-24 00:56:45,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:56:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-24 00:56:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-24 00:56:45,484 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:45,484 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:45,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:56:45,485 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:45,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-10-24 00:56:45,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:45,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108027957] [2020-10-24 00:56:45,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-24 00:56:45,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108027957] [2020-10-24 00:56:45,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:45,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:56:45,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709584140] [2020-10-24 00:56:45,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:56:45,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:56:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:56:45,801 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-10-24 00:56:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:46,139 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-10-24 00:56:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:56:46,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-10-24 00:56:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:46,142 INFO L225 Difference]: With dead ends: 51 [2020-10-24 00:56:46,142 INFO L226 Difference]: Without dead ends: 44 [2020-10-24 00:56:46,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:56:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-24 00:56:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-24 00:56:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-24 00:56:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-10-24 00:56:46,158 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-10-24 00:56:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:46,158 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-24 00:56:46,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:56:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-10-24 00:56:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-24 00:56:46,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:46,161 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:46,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:56:46,161 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-10-24 00:56:46,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:46,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1164371103] [2020-10-24 00:56:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:46,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:46,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:46,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:46,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:46,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-24 00:56:46,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1164371103] [2020-10-24 00:56:46,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:46,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:56:46,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737901272] [2020-10-24 00:56:46,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:56:46,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:46,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:56:46,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:56:46,441 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-10-24 00:56:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:46,978 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-10-24 00:56:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:56:46,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-10-24 00:56:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:46,981 INFO L225 Difference]: With dead ends: 56 [2020-10-24 00:56:46,981 INFO L226 Difference]: Without dead ends: 49 [2020-10-24 00:56:46,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:56:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-24 00:56:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-24 00:56:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-24 00:56:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-10-24 00:56:46,998 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-10-24 00:56:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:46,999 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-10-24 00:56:46,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:56:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-10-24 00:56:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 00:56:47,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:47,005 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:47,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:56:47,006 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-10-24 00:56:47,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:47,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641262860] [2020-10-24 00:56:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-24 00:56:47,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641262860] [2020-10-24 00:56:47,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:47,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:56:47,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725039216] [2020-10-24 00:56:47,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:56:47,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:56:47,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:56:47,257 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-10-24 00:56:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:47,760 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-24 00:56:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:56:47,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-24 00:56:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:47,762 INFO L225 Difference]: With dead ends: 61 [2020-10-24 00:56:47,762 INFO L226 Difference]: Without dead ends: 54 [2020-10-24 00:56:47,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:56:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-24 00:56:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-24 00:56:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-24 00:56:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-10-24 00:56:47,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-10-24 00:56:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:47,799 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-10-24 00:56:47,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:56:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-10-24 00:56:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 00:56:47,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:47,804 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:47,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:56:47,805 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-10-24 00:56:47,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:47,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1782936903] [2020-10-24 00:56:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:47,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-24 00:56:48,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1782936903] [2020-10-24 00:56:48,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:48,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:56:48,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656875422] [2020-10-24 00:56:48,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:56:48,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:56:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:56:48,122 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-10-24 00:56:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:48,655 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-10-24 00:56:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:56:48,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-10-24 00:56:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:48,659 INFO L225 Difference]: With dead ends: 66 [2020-10-24 00:56:48,659 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:56:48,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:56:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:56:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:56:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:56:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-24 00:56:48,679 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-10-24 00:56:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:48,679 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-24 00:56:48,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:56:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-24 00:56:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:56:48,681 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:48,681 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:48,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:56:48,682 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-10-24 00:56:48,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:48,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613642527] [2020-10-24 00:56:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-24 00:56:48,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613642527] [2020-10-24 00:56:48,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:48,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:56:49,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738811454] [2020-10-24 00:56:49,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:56:49,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:56:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:56:49,002 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-10-24 00:56:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:49,609 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-10-24 00:56:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:56:49,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-10-24 00:56:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:49,613 INFO L225 Difference]: With dead ends: 71 [2020-10-24 00:56:49,614 INFO L226 Difference]: Without dead ends: 64 [2020-10-24 00:56:49,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:56:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-24 00:56:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-24 00:56:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-24 00:56:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-10-24 00:56:49,631 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-10-24 00:56:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:49,632 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-10-24 00:56:49,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:56:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-10-24 00:56:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-24 00:56:49,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:49,634 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:49,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:56:49,634 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-10-24 00:56:49,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:49,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1785738381] [2020-10-24 00:56:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-24 00:56:49,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1785738381] [2020-10-24 00:56:49,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:49,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:56:49,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800370620] [2020-10-24 00:56:49,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:56:49,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:56:49,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:56:49,985 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-10-24 00:56:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:50,593 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-10-24 00:56:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:56:50,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-10-24 00:56:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:50,596 INFO L225 Difference]: With dead ends: 76 [2020-10-24 00:56:50,596 INFO L226 Difference]: Without dead ends: 69 [2020-10-24 00:56:50,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:56:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-24 00:56:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-24 00:56:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-24 00:56:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-10-24 00:56:50,615 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-10-24 00:56:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:50,615 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-10-24 00:56:50,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:56:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-10-24 00:56:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-24 00:56:50,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:50,617 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:50,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:56:50,618 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-10-24 00:56:50,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:50,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440063] [2020-10-24 00:56:50,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:50,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-24 00:56:51,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440063] [2020-10-24 00:56:51,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:51,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:56:51,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039255526] [2020-10-24 00:56:51,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:56:51,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:56:51,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:56:51,032 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-10-24 00:56:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:51,668 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-24 00:56:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:56:51,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-10-24 00:56:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:51,671 INFO L225 Difference]: With dead ends: 81 [2020-10-24 00:56:51,671 INFO L226 Difference]: Without dead ends: 74 [2020-10-24 00:56:51,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:56:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-24 00:56:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-24 00:56:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-24 00:56:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-10-24 00:56:51,690 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-10-24 00:56:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:51,690 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-10-24 00:56:51,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:56:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-10-24 00:56:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-24 00:56:51,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:51,692 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:51,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:56:51,693 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-10-24 00:56:51,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:51,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801294314] [2020-10-24 00:56:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:51,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:52,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:52,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-24 00:56:52,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801294314] [2020-10-24 00:56:52,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:52,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:56:52,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909033157] [2020-10-24 00:56:52,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:56:52,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:52,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:56:52,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:56:52,129 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-10-24 00:56:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:52,812 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-10-24 00:56:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:56:52,813 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-10-24 00:56:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:52,814 INFO L225 Difference]: With dead ends: 86 [2020-10-24 00:56:52,814 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:56:52,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:56:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:56:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:56:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:56:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-24 00:56:52,833 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-10-24 00:56:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:52,833 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-24 00:56:52,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:56:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-24 00:56:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-24 00:56:52,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:52,835 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:52,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:56:52,836 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-10-24 00:56:52,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:52,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [321518298] [2020-10-24 00:56:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:52,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:52,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:52,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-24 00:56:53,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [321518298] [2020-10-24 00:56:53,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:53,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:56:53,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617370354] [2020-10-24 00:56:53,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:56:53,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:53,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:56:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:56:53,479 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-10-24 00:56:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:54,201 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-10-24 00:56:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:56:54,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-10-24 00:56:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:54,204 INFO L225 Difference]: With dead ends: 91 [2020-10-24 00:56:54,204 INFO L226 Difference]: Without dead ends: 84 [2020-10-24 00:56:54,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:56:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-24 00:56:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-24 00:56:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-24 00:56:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-10-24 00:56:54,224 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-10-24 00:56:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:54,224 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-10-24 00:56:54,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:56:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-10-24 00:56:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-24 00:56:54,226 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:54,226 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:54,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:56:54,227 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-10-24 00:56:54,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:54,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1080667980] [2020-10-24 00:56:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-24 00:56:54,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1080667980] [2020-10-24 00:56:54,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:54,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:56:54,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293300980] [2020-10-24 00:56:54,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:56:54,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:56:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:56:54,898 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-10-24 00:56:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:55,736 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-10-24 00:56:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:56:55,737 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-10-24 00:56:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:55,738 INFO L225 Difference]: With dead ends: 96 [2020-10-24 00:56:55,739 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 00:56:55,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-24 00:56:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 00:56:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-24 00:56:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-24 00:56:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-10-24 00:56:55,763 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-10-24 00:56:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:55,765 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-10-24 00:56:55,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:56:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-10-24 00:56:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-24 00:56:55,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:55,767 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:55,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:56:55,768 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-10-24 00:56:55,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:55,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078278208] [2020-10-24 00:56:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:55,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:55,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:55,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:55,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-24 00:56:56,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078278208] [2020-10-24 00:56:56,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:56,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:56:56,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059892975] [2020-10-24 00:56:56,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:56:56,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:56:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:56:56,531 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-10-24 00:56:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:57,352 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-10-24 00:56:57,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:56:57,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-10-24 00:56:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:57,355 INFO L225 Difference]: With dead ends: 101 [2020-10-24 00:56:57,355 INFO L226 Difference]: Without dead ends: 94 [2020-10-24 00:56:57,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 00:56:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-24 00:56:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-24 00:56:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-24 00:56:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-10-24 00:56:57,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-10-24 00:56:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:57,378 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-10-24 00:56:57,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:56:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-10-24 00:56:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-24 00:56:57,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:57,381 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:57,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:56:57,381 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-10-24 00:56:57,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:57,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1075720122] [2020-10-24 00:56:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:57,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-24 00:56:58,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1075720122] [2020-10-24 00:56:58,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:58,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:56:58,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63053719] [2020-10-24 00:56:58,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:56:58,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:56:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:56:58,180 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-10-24 00:56:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:59,150 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-10-24 00:56:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:56:59,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-10-24 00:56:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:59,152 INFO L225 Difference]: With dead ends: 106 [2020-10-24 00:56:59,152 INFO L226 Difference]: Without dead ends: 99 [2020-10-24 00:56:59,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:56:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-24 00:56:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-10-24 00:56:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-24 00:56:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-10-24 00:56:59,177 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-10-24 00:56:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:59,177 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-10-24 00:56:59,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:56:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-10-24 00:56:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-24 00:56:59,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:59,182 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:56:59,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:56:59,182 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-10-24 00:56:59,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:59,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1829298241] [2020-10-24 00:56:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:56:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:59,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:56:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-24 00:57:00,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1829298241] [2020-10-24 00:57:00,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:00,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:57:00,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901189031] [2020-10-24 00:57:00,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:57:00,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:57:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:57:00,068 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-10-24 00:57:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:01,151 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-10-24 00:57:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:57:01,151 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-10-24 00:57:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:01,153 INFO L225 Difference]: With dead ends: 111 [2020-10-24 00:57:01,154 INFO L226 Difference]: Without dead ends: 104 [2020-10-24 00:57:01,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-24 00:57:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-24 00:57:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-24 00:57:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-24 00:57:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-10-24 00:57:01,172 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-10-24 00:57:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:01,172 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-10-24 00:57:01,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:57:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-10-24 00:57:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-10-24 00:57:01,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:01,175 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:01,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:57:01,175 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-10-24 00:57:01,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:01,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319001875] [2020-10-24 00:57:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:01,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-24 00:57:02,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319001875] [2020-10-24 00:57:02,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:02,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:57:02,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685040996] [2020-10-24 00:57:02,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:57:02,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:57:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:57:02,062 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-10-24 00:57:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:03,134 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-10-24 00:57:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:57:03,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-10-24 00:57:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:03,137 INFO L225 Difference]: With dead ends: 116 [2020-10-24 00:57:03,137 INFO L226 Difference]: Without dead ends: 109 [2020-10-24 00:57:03,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-24 00:57:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-24 00:57:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-24 00:57:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-24 00:57:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-10-24 00:57:03,154 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-10-24 00:57:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:03,155 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-10-24 00:57:03,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:57:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-10-24 00:57:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-24 00:57:03,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:03,157 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:03,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:57:03,158 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:03,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-10-24 00:57:03,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:03,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206413626] [2020-10-24 00:57:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:03,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-24 00:57:04,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206413626] [2020-10-24 00:57:04,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:04,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:57:04,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284571498] [2020-10-24 00:57:04,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:57:04,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:57:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:57:04,119 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-10-24 00:57:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:05,220 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-10-24 00:57:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:57:05,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-10-24 00:57:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:05,223 INFO L225 Difference]: With dead ends: 121 [2020-10-24 00:57:05,223 INFO L226 Difference]: Without dead ends: 114 [2020-10-24 00:57:05,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-24 00:57:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-24 00:57:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-24 00:57:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-24 00:57:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-10-24 00:57:05,240 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-10-24 00:57:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:05,241 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-10-24 00:57:05,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:57:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-10-24 00:57:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-24 00:57:05,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:05,244 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:05,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:57:05,244 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-10-24 00:57:05,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:05,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100800150] [2020-10-24 00:57:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:05,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:06,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:06,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-24 00:57:06,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100800150] [2020-10-24 00:57:06,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:06,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:57:06,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247468173] [2020-10-24 00:57:06,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:57:06,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:57:06,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:57:06,242 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-10-24 00:57:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:07,428 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-10-24 00:57:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:57:07,428 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-10-24 00:57:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:07,430 INFO L225 Difference]: With dead ends: 126 [2020-10-24 00:57:07,430 INFO L226 Difference]: Without dead ends: 119 [2020-10-24 00:57:07,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-24 00:57:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-24 00:57:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-24 00:57:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-24 00:57:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-10-24 00:57:07,454 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-10-24 00:57:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:07,454 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-10-24 00:57:07,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:57:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-10-24 00:57:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-24 00:57:07,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:07,457 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:07,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:57:07,457 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-10-24 00:57:07,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:07,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268041223] [2020-10-24 00:57:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:07,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-24 00:57:08,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268041223] [2020-10-24 00:57:08,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:08,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:57:08,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988508587] [2020-10-24 00:57:08,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:57:08,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:57:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:57:08,655 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-10-24 00:57:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:09,980 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-10-24 00:57:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:57:09,980 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-10-24 00:57:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:09,982 INFO L225 Difference]: With dead ends: 131 [2020-10-24 00:57:09,982 INFO L226 Difference]: Without dead ends: 124 [2020-10-24 00:57:09,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 00:57:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-24 00:57:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-10-24 00:57:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:57:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-10-24 00:57:10,005 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-10-24 00:57:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:10,005 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-10-24 00:57:10,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:57:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-10-24 00:57:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-10-24 00:57:10,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:10,009 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:10,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 00:57:10,009 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-10-24 00:57:10,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:10,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2120702598] [2020-10-24 00:57:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:10,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-24 00:57:11,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2120702598] [2020-10-24 00:57:11,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:11,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:57:11,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130583483] [2020-10-24 00:57:11,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:57:11,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:57:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:57:11,267 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-10-24 00:57:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:12,699 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-10-24 00:57:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:57:12,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-10-24 00:57:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:12,702 INFO L225 Difference]: With dead ends: 136 [2020-10-24 00:57:12,702 INFO L226 Difference]: Without dead ends: 129 [2020-10-24 00:57:12,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-24 00:57:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-24 00:57:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-10-24 00:57:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-24 00:57:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-10-24 00:57:12,721 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-10-24 00:57:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:12,721 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-10-24 00:57:12,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:57:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-10-24 00:57:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-24 00:57:12,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:12,724 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:12,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 00:57:12,725 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:12,725 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-10-24 00:57:12,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:12,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [104977798] [2020-10-24 00:57:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:12,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:12,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:12,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:12,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:13,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-24 00:57:14,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [104977798] [2020-10-24 00:57:14,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:14,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:57:14,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140472853] [2020-10-24 00:57:14,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:57:14,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:14,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:57:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:57:14,014 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 26 states. [2020-10-24 00:57:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:15,585 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-10-24 00:57:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:57:15,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-10-24 00:57:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:15,588 INFO L225 Difference]: With dead ends: 141 [2020-10-24 00:57:15,588 INFO L226 Difference]: Without dead ends: 134 [2020-10-24 00:57:15,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=813, Invalid=1539, Unknown=0, NotChecked=0, Total=2352 [2020-10-24 00:57:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-24 00:57:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-24 00:57:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 00:57:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2020-10-24 00:57:15,608 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 207 [2020-10-24 00:57:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:15,608 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2020-10-24 00:57:15,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:57:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2020-10-24 00:57:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-10-24 00:57:15,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:15,610 INFO L422 BasicCegarLoop]: trace histogram [22, 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, 1] [2020-10-24 00:57:15,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 00:57:15,611 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1160852928, now seen corresponding path program 21 times [2020-10-24 00:57:15,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:15,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1521121250] [2020-10-24 00:57:15,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:15,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:15,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:15,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:15,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:15,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:15,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:16,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1995 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-24 00:57:17,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1521121250] [2020-10-24 00:57:17,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:17,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:57:17,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701308631] [2020-10-24 00:57:17,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:57:17,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:57:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:57:17,160 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 27 states. [2020-10-24 00:57:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:18,672 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-10-24 00:57:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:57:18,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-10-24 00:57:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:18,677 INFO L225 Difference]: With dead ends: 146 [2020-10-24 00:57:18,677 INFO L226 Difference]: Without dead ends: 139 [2020-10-24 00:57:18,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-10-24 00:57:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-24 00:57:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-10-24 00:57:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-24 00:57:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2020-10-24 00:57:18,695 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 216 [2020-10-24 00:57:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:18,696 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2020-10-24 00:57:18,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:57:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2020-10-24 00:57:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-24 00:57:18,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:18,697 INFO L422 BasicCegarLoop]: trace histogram [23, 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, 1] [2020-10-24 00:57:18,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 00:57:18,698 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133425, now seen corresponding path program 22 times [2020-10-24 00:57:18,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:18,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841287317] [2020-10-24 00:57:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:18,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:18,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:18,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:18,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:18,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:19,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-24 00:57:20,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841287317] [2020-10-24 00:57:20,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:20,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:57:20,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460412772] [2020-10-24 00:57:20,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:57:20,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:20,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:57:20,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:57:20,275 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 28 states. [2020-10-24 00:57:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:21,926 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-10-24 00:57:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:57:21,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-10-24 00:57:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:21,930 INFO L225 Difference]: With dead ends: 151 [2020-10-24 00:57:21,930 INFO L226 Difference]: Without dead ends: 144 [2020-10-24 00:57:21,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-10-24 00:57:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-24 00:57:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-24 00:57:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-24 00:57:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2020-10-24 00:57:21,949 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 225 [2020-10-24 00:57:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:21,949 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2020-10-24 00:57:21,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:57:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2020-10-24 00:57:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 00:57:21,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:21,951 INFO L422 BasicCegarLoop]: trace histogram [24, 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, 1] [2020-10-24 00:57:21,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 00:57:21,952 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1123076554, now seen corresponding path program 23 times [2020-10-24 00:57:21,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:21,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758461075] [2020-10-24 00:57:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:22,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2392 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2020-10-24 00:57:23,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758461075] [2020-10-24 00:57:23,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:23,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 00:57:23,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216597401] [2020-10-24 00:57:23,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 00:57:23,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 00:57:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:57:23,681 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 29 states. [2020-10-24 00:57:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:25,357 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2020-10-24 00:57:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:57:25,357 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-10-24 00:57:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:25,360 INFO L225 Difference]: With dead ends: 156 [2020-10-24 00:57:25,360 INFO L226 Difference]: Without dead ends: 149 [2020-10-24 00:57:25,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-10-24 00:57:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-24 00:57:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-10-24 00:57:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-10-24 00:57:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2020-10-24 00:57:25,382 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 234 [2020-10-24 00:57:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:25,383 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2020-10-24 00:57:25,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 00:57:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2020-10-24 00:57:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-10-24 00:57:25,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:25,385 INFO L422 BasicCegarLoop]: trace histogram [25, 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, 1] [2020-10-24 00:57:25,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 00:57:25,385 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1991346821, now seen corresponding path program 24 times [2020-10-24 00:57:25,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:25,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [144458423] [2020-10-24 00:57:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:25,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:26,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2604 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2020-10-24 00:57:27,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [144458423] [2020-10-24 00:57:27,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:27,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-10-24 00:57:27,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633546465] [2020-10-24 00:57:27,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 00:57:27,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 00:57:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:57:27,231 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 30 states. [2020-10-24 00:57:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:28,990 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2020-10-24 00:57:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 00:57:28,991 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 243 [2020-10-24 00:57:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:28,992 INFO L225 Difference]: With dead ends: 161 [2020-10-24 00:57:28,992 INFO L226 Difference]: Without dead ends: 154 [2020-10-24 00:57:28,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-10-24 00:57:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-24 00:57:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2020-10-24 00:57:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-10-24 00:57:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2020-10-24 00:57:29,009 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 243 [2020-10-24 00:57:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:29,010 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2020-10-24 00:57:29,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-24 00:57:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2020-10-24 00:57:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-10-24 00:57:29,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:29,012 INFO L422 BasicCegarLoop]: trace histogram [26, 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, 1] [2020-10-24 00:57:29,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 00:57:29,012 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash 492729940, now seen corresponding path program 25 times [2020-10-24 00:57:29,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:29,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [197576093] [2020-10-24 00:57:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:29,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:29,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:57:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:29,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:29,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:29,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:29,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:30,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:31,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:32,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:32,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:32,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:32,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:32,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:32,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:33,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:57:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 1524 proven. 50 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2020-10-24 00:57:34,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [197576093] [2020-10-24 00:57:34,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:34,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2020-10-24 00:57:34,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274702825] [2020-10-24 00:57:34,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 62 states [2020-10-24 00:57:34,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2020-10-24 00:57:34,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3055, Unknown=0, NotChecked=0, Total=3782 [2020-10-24 00:57:34,154 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 62 states. [2020-10-24 00:57:38,718 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-24 00:57:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:49,182 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-10-24 00:57:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-10-24 00:57:49,182 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 252 [2020-10-24 00:57:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:49,183 INFO L225 Difference]: With dead ends: 154 [2020-10-24 00:57:49,183 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:57:49,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3032 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=4325, Invalid=17137, Unknown=0, NotChecked=0, Total=21462 [2020-10-24 00:57:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:57:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:57:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:57:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:57:49,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2020-10-24 00:57:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:49,192 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:57:49,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2020-10-24 00:57:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:57:49,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:57:49,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 00:57:49,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:57:49,331 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 122 [2020-10-24 00:57:49,878 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2020-10-24 00:57:50,041 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2020-10-24 00:57:52,008 WARN L193 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 208 DAG size of output: 164 [2020-10-24 00:57:53,579 WARN L193 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 181 DAG size of output: 134 [2020-10-24 00:57:55,017 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 181 DAG size of output: 134 [2020-10-24 00:57:56,603 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2020-10-24 00:57:58,135 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2020-10-24 00:57:58,333 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,334 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,335 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:57:58,336 INFO L270 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and (<= (+ |sum_#in~m| 24) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 (<= |sum_#in~n| 14) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 23) |sum_#res|) .cse1 (<= |sum_#in~n| 23)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#in~n| 19) .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse0 .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 15)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= |sum_#in~n| 22) .cse0 .cse1 (<= (+ |sum_#in~m| 22) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= (+ |sum_#in~m| 25) |sum_#res|)) (and .cse3 (<= |sum_#in~n| 24))))) [2020-10-24 00:57:58,336 INFO L270 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-10-24 00:57:58,337 INFO L270 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 (<= |sum_#in~n| 24) .cse1 .cse2 (<= (+ |sum_#in~m| 24) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 22) |sum_#t~ret7|) (<= |sum_#in~n| 22) .cse1 .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 23) |sum_#t~ret7|) (<= |sum_#in~n| 23) .cse2) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 21) |sum_#t~ret7|) .cse1 .cse2 (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 18) .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#t~ret7|) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-24 00:57:58,337 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-10-24 00:57:58,337 INFO L270 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 (<= |sum_#in~n| 24) .cse1 .cse2 (<= (+ |sum_#in~m| 24) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 22) |sum_#t~ret7|) (<= |sum_#in~n| 22) .cse1 .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 23) |sum_#t~ret7|) (<= |sum_#in~n| 23) .cse2) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 21) |sum_#t~ret7|) .cse1 .cse2 (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 18) .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#t~ret7|) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-24 00:57:58,338 INFO L270 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-10-24 00:57:58,338 INFO L270 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (and (let ((.cse27 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#res| .cse27)) (.cse3 (<= |sum_#t~ret7| .cse27))) (or (let ((.cse0 (+ |sum_#in~m| 10))) (and (<= .cse0 |sum_#res|) .cse1 .cse2 (<= .cse0 |sum_#t~ret7|) .cse3 (<= |sum_#in~n| 10))) (let ((.cse4 (+ |sum_#in~m| 12))) (and .cse1 .cse2 (<= |sum_#in~n| 12) (<= .cse4 |sum_#t~ret7|) .cse3 (<= .cse4 |sum_#res|))) (let ((.cse5 (+ |sum_#in~m| 20))) (and .cse1 .cse2 (<= |sum_#in~n| 20) (<= .cse5 |sum_#t~ret7|) (<= .cse5 |sum_#res|) .cse3)) (let ((.cse6 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse1 .cse2 (<= .cse6 |sum_#t~ret7|) (<= .cse6 |sum_#res|) .cse3)) (let ((.cse7 (+ |sum_#in~m| 15))) (and (<= .cse7 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 15) .cse3 (<= .cse7 |sum_#t~ret7|))) (let ((.cse8 (+ |sum_#in~m| 17))) (and (<= |sum_#in~n| 17) .cse1 .cse2 (<= .cse8 |sum_#t~ret7|) .cse3 (<= .cse8 |sum_#res|))) (let ((.cse9 (+ |sum_#in~m| 6))) (and (<= .cse9 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 6) (<= .cse9 |sum_#t~ret7|) .cse3)) (let ((.cse10 (+ |sum_#in~m| 23))) (and .cse1 (<= .cse10 |sum_#res|) (<= .cse10 |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 23) .cse3)) (let ((.cse11 (+ |sum_#in~m| 24))) (and (<= .cse11 |sum_#res|) .cse1 .cse2 .cse3 (<= .cse11 |sum_#t~ret7|))) (let ((.cse12 (+ |sum_#in~m| 14))) (and (<= .cse12 |sum_#t~ret7|) (<= .cse12 |sum_#res|) .cse1 (<= |sum_#in~n| 14) .cse2 .cse3)) (let ((.cse13 (+ |sum_#in~m| 13))) (and .cse1 (<= .cse13 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2 (<= .cse13 |sum_#res|) .cse3)) (let ((.cse14 (+ |sum_#in~m| 11))) (and (<= .cse14 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 11) .cse3 (<= .cse14 |sum_#t~ret7|))) (let ((.cse15 (+ |sum_#in~m| 3))) (and (<= .cse15 |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2 (<= .cse15 |sum_#res|) .cse3)) (let ((.cse16 (+ |sum_#in~m| 8))) (and .cse1 (<= |sum_#in~n| 8) .cse2 (<= .cse16 |sum_#res|) (<= .cse16 |sum_#t~ret7|) .cse3)) (let ((.cse17 (+ |sum_#in~m| 9))) (and .cse1 .cse2 (<= .cse17 |sum_#res|) (<= .cse17 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse3)) (let ((.cse18 (+ |sum_#in~m| 16))) (and (<= .cse18 |sum_#res|) .cse1 .cse2 (<= .cse18 |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse3)) (let ((.cse19 (+ |sum_#in~m| 22))) (and (<= .cse19 |sum_#t~ret7|) (<= |sum_#in~n| 22) .cse1 .cse2 (<= .cse19 |sum_#res|) .cse3)) (let ((.cse20 (+ |sum_#in~m| 1))) (and (<= .cse20 |sum_#t~ret7|) (<= .cse20 |sum_#res|) .cse1 (<= |sum_#in~n| 1) .cse2 .cse3)) (let ((.cse21 (+ |sum_#in~m| 7))) (and .cse1 (<= .cse21 |sum_#res|) (<= |sum_#in~n| 7) .cse2 (<= .cse21 |sum_#t~ret7|) .cse3)) (let ((.cse22 (+ |sum_#in~m| 4))) (and (<= .cse22 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2 (<= .cse22 |sum_#res|) .cse3)) (let ((.cse23 (+ |sum_#in~m| 2))) (and (<= .cse23 |sum_#res|) (<= |sum_#in~n| 2) .cse1 .cse2 .cse3 (<= .cse23 |sum_#t~ret7|))) (let ((.cse24 (+ |sum_#in~m| 18))) (and (<= .cse24 |sum_#res|) (<= .cse24 |sum_#t~ret7|) .cse1 .cse2 (<= |sum_#in~n| 18) .cse3)) (let ((.cse25 (+ |sum_#in~m| 19))) (and (<= |sum_#in~n| 19) .cse1 (<= .cse25 |sum_#t~ret7|) .cse2 (<= .cse25 |sum_#res|) .cse3)) (let ((.cse26 (+ |sum_#in~m| 21))) (and (<= .cse26 |sum_#t~ret7|) .cse1 .cse2 (<= .cse26 |sum_#res|) .cse3 (<= |sum_#in~n| 21)))))) (let ((.cse28 (= sum_~n |sum_#in~n|))) (or (and .cse28 (<= |sum_#in~n| 24)) (let ((.cse29 (+ |sum_#in~m| 25))) (and .cse28 (<= .cse29 |sum_#res|) (<= .cse29 |sum_#t~ret7|)))))) [2020-10-24 00:57:58,338 INFO L270 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-10-24 00:57:58,339 INFO L270 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and (<= (+ |sum_#in~m| 24) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 (<= |sum_#in~n| 14) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 23) |sum_#res|) .cse1 (<= |sum_#in~n| 23)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#in~n| 19) .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse0 .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 15)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= |sum_#in~n| 22) .cse0 .cse1 (<= (+ |sum_#in~m| 22) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= (+ |sum_#in~m| 25) |sum_#res|)) (and .cse3 (<= |sum_#in~n| 24))))) [2020-10-24 00:57:58,339 INFO L277 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-10-24 00:57:58,339 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-10-24 00:57:58,339 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 25 main_~a~0) [2020-10-24 00:57:58,339 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= main_~a~0 25) (<= main_~result~0 main_~a~0) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 25) (<= main_~a~0 |main_#t~ret8|) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 25 main_~a~0) [2020-10-24 00:57:58,340 INFO L270 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 25) (<= main_~a~0 |main_#t~ret8|) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-24 00:57:58,341 INFO L270 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= main_~a~0 25) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-24 00:57:58,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:57:58 BoogieIcfgContainer [2020-10-24 00:57:58,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:57:58,374 INFO L168 Benchmark]: Toolchain (without parser) took 75240.69 ms. Allocated memory was 166.7 MB in the beginning and 731.9 MB in the end (delta: 565.2 MB). Free memory was 143.8 MB in the beginning and 554.6 MB in the end (delta: -410.8 MB). Peak memory consumption was 435.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:58,374 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 125.8 MB. Free memory was 99.9 MB in the beginning and 99.8 MB in the end (delta: 120.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:57:58,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.62 ms. Allocated memory is still 166.7 MB. Free memory was 143.2 MB in the beginning and 134.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:58,375 INFO L168 Benchmark]: Boogie Preprocessor took 34.95 ms. Allocated memory is still 166.7 MB. Free memory was 134.1 MB in the beginning and 132.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:58,376 INFO L168 Benchmark]: RCFGBuilder took 378.94 ms. Allocated memory is still 166.7 MB. Free memory was 132.9 MB in the beginning and 119.5 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:58,377 INFO L168 Benchmark]: TraceAbstraction took 74567.40 ms. Allocated memory was 166.7 MB in the beginning and 731.9 MB in the end (delta: 565.2 MB). Free memory was 119.1 MB in the beginning and 554.6 MB in the end (delta: -435.5 MB). Peak memory consumption was 411.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:58,379 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.27 ms. Allocated memory is still 125.8 MB. Free memory was 99.9 MB in the beginning and 99.8 MB in the end (delta: 120.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 243.62 ms. Allocated memory is still 166.7 MB. Free memory was 143.2 MB in the beginning and 134.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.95 ms. Allocated memory is still 166.7 MB. Free memory was 134.1 MB in the beginning and 132.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 378.94 ms. Allocated memory is still 166.7 MB. Free memory was 132.9 MB in the beginning and 119.5 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 74567.40 ms. Allocated memory was 166.7 MB in the beginning and 731.9 MB in the end (delta: 565.2 MB). Free memory was 119.1 MB in the beginning and 554.6 MB in the end (delta: -435.5 MB). Peak memory consumption was 411.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum: (((((((((((((((((((((((((((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m)) || ((\old(m) + 24 <= \result && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 16 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 16)) || (((\old(m) + 14 <= \result && m == \old(m)) && \old(n) <= 14) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((m == \old(m) && \old(m) + 23 <= \result) && \result <= \old(n) + \old(m)) && \old(n) <= 23)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \old(n) <= 8) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((m == \old(m) && \old(n) <= 13) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || (((\old(m) + 10 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || (((\old(m) + 11 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 11)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 12) && \old(m) + 12 <= \result)) || (((\old(n) <= 19 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 19 <= \result)) || (((\old(n) <= 17 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 17 <= \result)) || (((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m))) || (((\old(m) + 18 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 18)) || (((\old(m) + 15 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 15)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 21 <= \result) && \old(n) <= 21)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 20) && \old(m) + 20 <= \result)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) || (((\old(n) <= 22 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 22 <= \result)) && ((n == \old(n) && \old(m) + 25 <= \result) || (n == \old(n) && \old(n) <= 24)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 25 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 65.2s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 748 SDtfs, 3235 SDslu, 1858 SDs, 0 SdLazy, 5624 SolverSat, 933 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 920 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8882 ImplicationChecksByTransitivity, 37.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred 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, 26 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 149 PreInvPairs, 524 NumberOfFragments, 2712 HoareAnnotationTreeSize, 149 FomulaSimplifications, 7523 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 39 FomulaSimplificationsInter, 10396 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 3627 NumberOfCodeBlocks, 3627 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3601 ConstructedInterpolants, 0 QuantifiedInterpolants, 2024211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 12875/25025 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...