/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/id_i25_o25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:55:07,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:55:07,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:55:07,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:55:07,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:55:07,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:55:07,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:55:07,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:55:07,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:55:07,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:55:07,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:55:07,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:55:07,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:55:07,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:55:07,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:55:07,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:55:07,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:55:07,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:55:07,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:55:07,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:55:07,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:55:07,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:55:07,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:55:07,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:55:07,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:55:07,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:55:07,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:55:07,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:55:07,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:55:07,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:55:07,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:55:07,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:55:07,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:55:07,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:55:07,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:55:07,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:55:07,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:55:07,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:55:07,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:55:07,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:55:07,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:55:07,728 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:55:07,742 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:55:07,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:55:07,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:55:07,744 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:55:07,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:55:07,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:55:07,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:55:07,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:55:07,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:55:07,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:55:07,746 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:55:07,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:55:07,747 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:55:07,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:55:07,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:55:07,747 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:55:07,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:55:07,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:55:07,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:07,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:55:07,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:55:07,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:55:07,749 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:55:08,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:55:08,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:55:08,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:55:08,240 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:55:08,241 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:55:08,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-10-24 00:55:08,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674182093/6b698b6af7e44d8eb67bb8dcfa7c053d/FLAG32019b299 [2020-10-24 00:55:09,100 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:55:09,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i25_o25-1.c [2020-10-24 00:55:09,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674182093/6b698b6af7e44d8eb67bb8dcfa7c053d/FLAG32019b299 [2020-10-24 00:55:09,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/674182093/6b698b6af7e44d8eb67bb8dcfa7c053d [2020-10-24 00:55:09,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:55:09,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:55:09,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:09,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:55:09,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:55:09,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd8c406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09, skipping insertion in model container [2020-10-24 00:55:09,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:55:09,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:55:09,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:09,681 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:55:09,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:09,714 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:55:09,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09 WrapperNode [2020-10-24 00:55:09,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:09,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:55:09,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:55:09,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:55:09,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (1/1) ... [2020-10-24 00:55:09,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:55:09,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:55:09,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:55:09,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:55:09,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (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:55:09,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:55:09,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:55:09,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:55:09,839 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:55:09,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:55:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:55:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:55:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:55:09,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:55:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:55:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:55:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:55:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:55:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:55:10,352 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:55:10,353 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:55:10,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:10 BoogieIcfgContainer [2020-10-24 00:55:10,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:55:10,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:55:10,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:55:10,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:55:10,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:55:09" (1/3) ... [2020-10-24 00:55:10,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1afee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:10, skipping insertion in model container [2020-10-24 00:55:10,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:09" (2/3) ... [2020-10-24 00:55:10,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1afee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:10, skipping insertion in model container [2020-10-24 00:55:10,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:10" (3/3) ... [2020-10-24 00:55:10,370 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i25_o25-1.c [2020-10-24 00:55:10,385 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:55:10,392 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:55:10,408 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:55:10,452 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:55:10,452 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:55:10,453 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:55:10,453 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:55:10,453 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:55:10,453 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:55:10,453 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:55:10,453 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:55:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-24 00:55:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:55:10,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:10,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:10,493 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-24 00:55:10,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:10,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497354579] [2020-10-24 00:55:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,017 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:55:11,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497354579] [2020-10-24 00:55:11,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:55:11,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:55:11,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981707058] [2020-10-24 00:55:11,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:55:11,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:55:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:55:11,047 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-24 00:55:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:11,338 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-24 00:55:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:55:11,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:55:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:11,351 INFO L225 Difference]: With dead ends: 50 [2020-10-24 00:55:11,351 INFO L226 Difference]: Without dead ends: 32 [2020-10-24 00:55:11,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:55:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-24 00:55:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-24 00:55:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 00:55:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-24 00:55:11,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-24 00:55:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:11,412 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-24 00:55:11,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:55:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-24 00:55:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:55:11,414 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:11,415 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:11,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:55:11,415 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:11,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-24 00:55:11,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:11,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678313201] [2020-10-24 00:55:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:55:11,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678313201] [2020-10-24 00:55:11,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:11,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:55:11,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493520983] [2020-10-24 00:55:11,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:55:11,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:55:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:55:11,624 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-24 00:55:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:11,928 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-24 00:55:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:55:11,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-24 00:55:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:11,931 INFO L225 Difference]: With dead ends: 44 [2020-10-24 00:55:11,931 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:55:11,934 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:55:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:55:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:55:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:55:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-24 00:55:11,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-24 00:55:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:11,963 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-24 00:55:11,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:55:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-24 00:55:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-24 00:55:11,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:11,968 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:11,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:55:11,970 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-24 00:55:11,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:11,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467100648] [2020-10-24 00:55:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-24 00:55:12,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467100648] [2020-10-24 00:55:12,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:12,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:55:12,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439480982] [2020-10-24 00:55:12,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:55:12,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:12,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:55:12,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:55:12,155 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-24 00:55:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:12,440 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-24 00:55:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:55:12,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-24 00:55:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:12,443 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:55:12,443 INFO L226 Difference]: Without dead ends: 42 [2020-10-24 00:55:12,444 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:55:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-24 00:55:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-24 00:55:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 00:55:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-24 00:55:12,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-24 00:55:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:12,459 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-24 00:55:12,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:55:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-24 00:55:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 00:55:12,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:12,461 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:12,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:55:12,462 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-24 00:55:12,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:12,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [972816738] [2020-10-24 00:55:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-24 00:55:12,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [972816738] [2020-10-24 00:55:12,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:12,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:55:12,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552292926] [2020-10-24 00:55:12,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:55:12,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:55:12,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:55:12,660 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-24 00:55:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:12,998 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-24 00:55:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:55:12,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-24 00:55:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:13,001 INFO L225 Difference]: With dead ends: 54 [2020-10-24 00:55:13,001 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 00:55:13,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 00:55:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-24 00:55:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 00:55:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-24 00:55:13,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-24 00:55:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:13,017 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-24 00:55:13,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:55:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-24 00:55:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 00:55:13,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:13,019 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:13,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:55:13,019 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:13,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-24 00:55:13,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:13,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084188450] [2020-10-24 00:55:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:55:13,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084188450] [2020-10-24 00:55:13,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:13,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:55:13,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281486330] [2020-10-24 00:55:13,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:55:13,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:55:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:13,253 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-24 00:55:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:13,634 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-24 00:55:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:55:13,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-24 00:55:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:13,637 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:55:13,637 INFO L226 Difference]: Without dead ends: 52 [2020-10-24 00:55:13,638 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:55:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-24 00:55:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-24 00:55:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-24 00:55:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-24 00:55:13,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-24 00:55:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:13,651 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-24 00:55:13,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:55:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-24 00:55:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:55:13,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:13,653 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:13,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:55:13,654 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-24 00:55:13,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:13,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1313202911] [2020-10-24 00:55:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 00:55:13,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1313202911] [2020-10-24 00:55:13,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:13,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:55:13,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885643474] [2020-10-24 00:55:13,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:55:13,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:55:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:55:13,984 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-24 00:55:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:14,494 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-24 00:55:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:55:14,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-24 00:55:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:14,501 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:55:14,502 INFO L226 Difference]: Without dead ends: 57 [2020-10-24 00:55:14,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:55:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-24 00:55:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-24 00:55:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 00:55:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-24 00:55:14,519 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-24 00:55:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:14,520 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-24 00:55:14,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:55:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-24 00:55:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:55:14,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:14,522 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:14,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:55:14,522 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:14,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-24 00:55:14,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:14,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [445880058] [2020-10-24 00:55:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 00:55:14,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [445880058] [2020-10-24 00:55:14,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:14,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:55:14,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97301125] [2020-10-24 00:55:14,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:55:14,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:14,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:55:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:55:14,810 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-24 00:55:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:15,371 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-24 00:55:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:55:15,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-24 00:55:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:15,374 INFO L225 Difference]: With dead ends: 69 [2020-10-24 00:55:15,374 INFO L226 Difference]: Without dead ends: 62 [2020-10-24 00:55:15,375 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:55:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-24 00:55:15,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-24 00:55:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 00:55:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-24 00:55:15,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-24 00:55:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:15,403 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-24 00:55:15,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:55:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-24 00:55:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:55:15,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:15,405 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:15,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:55:15,406 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-24 00:55:15,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:15,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825087886] [2020-10-24 00:55:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-24 00:55:15,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825087886] [2020-10-24 00:55:15,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:15,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:55:15,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592234147] [2020-10-24 00:55:15,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:55:15,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:55:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:55:15,677 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-24 00:55:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:16,307 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-24 00:55:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:55:16,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-24 00:55:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:16,309 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:55:16,311 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:55:16,313 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:55:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:55:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-24 00:55:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 00:55:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 00:55:16,331 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-24 00:55:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:16,332 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 00:55:16,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:55:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 00:55:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-24 00:55:16,334 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:16,334 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:16,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:55:16,334 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-24 00:55:16,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:16,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536052516] [2020-10-24 00:55:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-24 00:55:16,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536052516] [2020-10-24 00:55:16,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:16,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:55:16,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536681194] [2020-10-24 00:55:16,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:55:16,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:55:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:55:16,740 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-24 00:55:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:17,332 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-24 00:55:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:55:17,332 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-24 00:55:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:17,334 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:55:17,334 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 00:55:17,348 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:55:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 00:55:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-24 00:55:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 00:55:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-24 00:55:17,367 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-24 00:55:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:17,368 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-24 00:55:17,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:55:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-24 00:55:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:55:17,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:17,370 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:17,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:55:17,370 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-24 00:55:17,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:17,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228331264] [2020-10-24 00:55:17,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-24 00:55:17,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228331264] [2020-10-24 00:55:17,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:17,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:55:17,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658843917] [2020-10-24 00:55:17,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:55:17,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:55:17,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:17,770 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-24 00:55:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:18,474 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-24 00:55:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:55:18,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-24 00:55:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:18,476 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:55:18,476 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:55:18,477 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:55:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:55:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-24 00:55:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 00:55:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-24 00:55:18,510 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-24 00:55:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:18,511 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-24 00:55:18,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:55:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-24 00:55:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-24 00:55:18,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:18,513 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:18,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:55:18,513 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-24 00:55:18,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:18,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491299541] [2020-10-24 00:55:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-24 00:55:19,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491299541] [2020-10-24 00:55:19,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:19,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:55:19,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8930308] [2020-10-24 00:55:19,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:55:19,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:19,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:55:19,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:55:19,053 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-24 00:55:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:19,855 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-24 00:55:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:55:19,856 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-24 00:55:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:19,858 INFO L225 Difference]: With dead ends: 89 [2020-10-24 00:55:19,858 INFO L226 Difference]: Without dead ends: 82 [2020-10-24 00:55:19,860 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:55:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-24 00:55:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-24 00:55:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 00:55:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-24 00:55:19,874 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-24 00:55:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:19,875 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-24 00:55:19,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:55:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-24 00:55:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-24 00:55:19,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:19,876 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:19,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:55:19,877 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-24 00:55:19,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:19,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [86283175] [2020-10-24 00:55:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:19,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-24 00:55:20,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [86283175] [2020-10-24 00:55:20,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:20,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:55:20,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390684549] [2020-10-24 00:55:20,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:55:20,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:55:20,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:55:20,380 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-24 00:55:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:21,233 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-24 00:55:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:55:21,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-24 00:55:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:21,235 INFO L225 Difference]: With dead ends: 94 [2020-10-24 00:55:21,235 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:55:21,236 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:55:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:55:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-24 00:55:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 00:55:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-24 00:55:21,253 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-24 00:55:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:21,254 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-24 00:55:21,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:55:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-24 00:55:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-24 00:55:21,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:21,256 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:21,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:55:21,256 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-24 00:55:21,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:21,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1855866520] [2020-10-24 00:55:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-24 00:55:21,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1855866520] [2020-10-24 00:55:21,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:21,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:55:21,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668674342] [2020-10-24 00:55:21,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:55:21,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:55:21,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:55:21,863 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-24 00:55:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:22,683 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-24 00:55:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:55:22,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-24 00:55:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:22,685 INFO L225 Difference]: With dead ends: 99 [2020-10-24 00:55:22,686 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 00:55:22,687 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:55:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 00:55:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-24 00:55:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-24 00:55:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-24 00:55:22,702 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-24 00:55:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:22,703 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-24 00:55:22,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:55:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-24 00:55:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:55:22,705 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:22,705 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:22,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:55:22,705 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-24 00:55:22,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:22,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177230958] [2020-10-24 00:55:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:22,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-24 00:55:23,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177230958] [2020-10-24 00:55:23,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:23,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:55:23,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331329392] [2020-10-24 00:55:23,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:55:23,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:55:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:55:23,318 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-24 00:55:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:24,289 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-24 00:55:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:55:24,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-24 00:55:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:24,291 INFO L225 Difference]: With dead ends: 104 [2020-10-24 00:55:24,291 INFO L226 Difference]: Without dead ends: 97 [2020-10-24 00:55:24,293 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:55:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-24 00:55:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-24 00:55:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-24 00:55:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-24 00:55:24,310 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-24 00:55:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:24,310 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-24 00:55:24,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:55:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-24 00:55:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-24 00:55:24,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:24,313 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:24,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:55:24,313 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-24 00:55:24,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:24,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811271855] [2020-10-24 00:55:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:24,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-24 00:55:25,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811271855] [2020-10-24 00:55:25,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:25,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:55:25,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745218948] [2020-10-24 00:55:25,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:55:25,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:25,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:55:25,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:25,071 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-24 00:55:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:26,084 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-24 00:55:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:55:26,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-24 00:55:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:26,087 INFO L225 Difference]: With dead ends: 109 [2020-10-24 00:55:26,087 INFO L226 Difference]: Without dead ends: 102 [2020-10-24 00:55:26,089 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:55:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-24 00:55:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-24 00:55:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-24 00:55:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-24 00:55:26,103 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-24 00:55:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:26,104 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-24 00:55:26,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:55:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-24 00:55:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-24 00:55:26,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:26,106 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:26,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:55:26,107 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-24 00:55:26,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:26,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648037476] [2020-10-24 00:55:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-10-24 00:55:26,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648037476] [2020-10-24 00:55:26,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:26,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-10-24 00:55:26,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260031704] [2020-10-24 00:55:26,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 00:55:26,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 00:55:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:55:26,956 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-10-24 00:55:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:28,029 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-10-24 00:55:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:55:28,030 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-10-24 00:55:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:28,036 INFO L225 Difference]: With dead ends: 114 [2020-10-24 00:55:28,036 INFO L226 Difference]: Without dead ends: 107 [2020-10-24 00:55:28,038 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:55:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-24 00:55:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-24 00:55:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-24 00:55:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-24 00:55:28,058 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-10-24 00:55:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:28,059 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-24 00:55:28,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 00:55:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-24 00:55:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-24 00:55:28,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:28,061 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:28,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:55:28,061 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-10-24 00:55:28,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:28,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981206628] [2020-10-24 00:55:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-10-24 00:55:28,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981206628] [2020-10-24 00:55:28,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:28,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 00:55:28,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753782865] [2020-10-24 00:55:28,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 00:55:28,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 00:55:28,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-24 00:55:28,948 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-10-24 00:55:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:30,107 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-10-24 00:55:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:55:30,107 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-10-24 00:55:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:30,110 INFO L225 Difference]: With dead ends: 119 [2020-10-24 00:55:30,110 INFO L226 Difference]: Without dead ends: 112 [2020-10-24 00:55:30,111 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:55:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-24 00:55:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-24 00:55:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-24 00:55:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-10-24 00:55:30,128 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-10-24 00:55:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:30,128 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-10-24 00:55:30,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 00:55:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-10-24 00:55:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-24 00:55:30,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:30,131 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:30,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:55:30,131 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-10-24 00:55:30,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:30,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628720776] [2020-10-24 00:55:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:30,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-10-24 00:55:31,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628720776] [2020-10-24 00:55:31,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:31,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-10-24 00:55:31,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855566992] [2020-10-24 00:55:31,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 00:55:31,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 00:55:31,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:55:31,018 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-10-24 00:55:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:32,201 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-10-24 00:55:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:55:32,207 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-10-24 00:55:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:32,209 INFO L225 Difference]: With dead ends: 124 [2020-10-24 00:55:32,209 INFO L226 Difference]: Without dead ends: 117 [2020-10-24 00:55:32,210 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:55:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-24 00:55:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-10-24 00:55:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-24 00:55:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-10-24 00:55:32,225 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-10-24 00:55:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:32,225 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-10-24 00:55:32,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 00:55:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-10-24 00:55:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-24 00:55:32,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:32,228 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:32,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 00:55:32,228 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-10-24 00:55:32,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:32,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211196187] [2020-10-24 00:55:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:32,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-10-24 00:55:33,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211196187] [2020-10-24 00:55:33,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:33,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 00:55:33,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950550604] [2020-10-24 00:55:33,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 00:55:33,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 00:55:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:55:33,165 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-10-24 00:55:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:34,331 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-10-24 00:55:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-24 00:55:34,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-10-24 00:55:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:34,334 INFO L225 Difference]: With dead ends: 129 [2020-10-24 00:55:34,334 INFO L226 Difference]: Without dead ends: 122 [2020-10-24 00:55:34,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 00:55:34,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-24 00:55:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-10-24 00:55:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-24 00:55:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-10-24 00:55:34,354 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-10-24 00:55:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:34,355 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-10-24 00:55:34,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 00:55:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-10-24 00:55:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-24 00:55:34,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:34,357 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:34,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 00:55:34,358 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:34,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-10-24 00:55:34,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:34,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894285788] [2020-10-24 00:55:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:34,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-10-24 00:55:35,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894285788] [2020-10-24 00:55:35,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:35,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-10-24 00:55:35,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888149230] [2020-10-24 00:55:35,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 00:55:35,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 00:55:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:55:35,426 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-10-24 00:55:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:36,698 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-10-24 00:55:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 00:55:36,698 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-10-24 00:55:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:36,700 INFO L225 Difference]: With dead ends: 134 [2020-10-24 00:55:36,701 INFO L226 Difference]: Without dead ends: 127 [2020-10-24 00:55:36,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-24 00:55:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-24 00:55:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-24 00:55:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 00:55:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-10-24 00:55:36,718 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-10-24 00:55:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:36,719 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-10-24 00:55:36,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 00:55:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-10-24 00:55:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-24 00:55:36,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:36,720 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:36,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 00:55:36,721 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-10-24 00:55:36,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:36,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786129506] [2020-10-24 00:55:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:36,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2020-10-24 00:55:37,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786129506] [2020-10-24 00:55:37,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:37,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 00:55:37,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452534256] [2020-10-24 00:55:37,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 00:55:37,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 00:55:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-10-24 00:55:37,959 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 26 states. [2020-10-24 00:55:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:39,493 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2020-10-24 00:55:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:55:39,494 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 185 [2020-10-24 00:55:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:39,498 INFO L225 Difference]: With dead ends: 139 [2020-10-24 00:55:39,498 INFO L226 Difference]: Without dead ends: 132 [2020-10-24 00:55:39,500 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:55:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-24 00:55:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-24 00:55:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-24 00:55:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2020-10-24 00:55:39,516 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 185 [2020-10-24 00:55:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:39,517 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2020-10-24 00:55:39,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 00:55:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2020-10-24 00:55:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-24 00:55:39,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:39,519 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:39,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 00:55:39,519 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1339041299, now seen corresponding path program 21 times [2020-10-24 00:55:39,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:39,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658175344] [2020-10-24 00:55:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:39,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2020-10-24 00:55:40,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658175344] [2020-10-24 00:55:40,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:40,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-10-24 00:55:40,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947364408] [2020-10-24 00:55:40,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-24 00:55:40,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-24 00:55:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-10-24 00:55:40,697 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2020-10-24 00:55:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:42,218 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2020-10-24 00:55:42,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:55:42,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 193 [2020-10-24 00:55:42,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:42,221 INFO L225 Difference]: With dead ends: 144 [2020-10-24 00:55:42,221 INFO L226 Difference]: Without dead ends: 137 [2020-10-24 00:55:42,223 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:55:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-24 00:55:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-24 00:55:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-24 00:55:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-10-24 00:55:42,241 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 193 [2020-10-24 00:55:42,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:42,241 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-10-24 00:55:42,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-24 00:55:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-10-24 00:55:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-24 00:55:42,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:42,243 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:42,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 00:55:42,243 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1769896713, now seen corresponding path program 22 times [2020-10-24 00:55:42,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:42,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406420299] [2020-10-24 00:55:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:42,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2020-10-24 00:55:43,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406420299] [2020-10-24 00:55:43,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:43,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 00:55:43,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692660156] [2020-10-24 00:55:43,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 00:55:43,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 00:55:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-10-24 00:55:43,770 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 28 states. [2020-10-24 00:55:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:45,382 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2020-10-24 00:55:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 00:55:45,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2020-10-24 00:55:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:45,385 INFO L225 Difference]: With dead ends: 149 [2020-10-24 00:55:45,385 INFO L226 Difference]: Without dead ends: 142 [2020-10-24 00:55:45,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-10-24 00:55:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-24 00:55:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-24 00:55:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:55:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2020-10-24 00:55:45,402 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 201 [2020-10-24 00:55:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:45,403 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2020-10-24 00:55:45,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 00:55:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2020-10-24 00:55:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-24 00:55:45,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:45,404 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:45,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 00:55:45,405 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2013305389, now seen corresponding path program 23 times [2020-10-24 00:55:45,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:45,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620421371] [2020-10-24 00:55:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:45,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2020-10-24 00:55:46,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620421371] [2020-10-24 00:55:46,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:46,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-10-24 00:55:46,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689095382] [2020-10-24 00:55:46,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-24 00:55:46,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:46,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-24 00:55:46,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:55:46,803 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 29 states. [2020-10-24 00:55:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:48,405 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-10-24 00:55:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 00:55:48,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 209 [2020-10-24 00:55:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:48,408 INFO L225 Difference]: With dead ends: 154 [2020-10-24 00:55:48,408 INFO L226 Difference]: Without dead ends: 147 [2020-10-24 00:55:48,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-10-24 00:55:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-24 00:55:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-24 00:55:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-24 00:55:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-10-24 00:55:48,426 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 209 [2020-10-24 00:55:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:48,427 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-10-24 00:55:48,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-24 00:55:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-10-24 00:55:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2020-10-24 00:55:48,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:48,430 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:48,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 00:55:48,430 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash -405782711, now seen corresponding path program 24 times [2020-10-24 00:55:48,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:48,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628724815] [2020-10-24 00:55:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:48,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2020-10-24 00:55:49,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628724815] [2020-10-24 00:55:49,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:49,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-10-24 00:55:49,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278759830] [2020-10-24 00:55:49,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 00:55:49,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:49,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 00:55:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:55:49,906 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 30 states. [2020-10-24 00:55:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:51,603 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2020-10-24 00:55:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 00:55:51,603 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2020-10-24 00:55:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:51,606 INFO L225 Difference]: With dead ends: 159 [2020-10-24 00:55:51,606 INFO L226 Difference]: Without dead ends: 152 [2020-10-24 00:55:51,608 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:55:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-24 00:55:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-24 00:55:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-24 00:55:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2020-10-24 00:55:51,624 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 217 [2020-10-24 00:55:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:51,625 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2020-10-24 00:55:51,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-24 00:55:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2020-10-24 00:55:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-24 00:55:51,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:51,626 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:51,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 00:55:51,626 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2086570605, now seen corresponding path program 25 times [2020-10-24 00:55:51,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:51,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [378493960] [2020-10-24 00:55:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:51,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:51,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:51,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:52,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:53,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:54,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2020-10-24 00:55:55,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [378493960] [2020-10-24 00:55:55,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:55,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2020-10-24 00:55:55,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822325150] [2020-10-24 00:55:55,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 56 states [2020-10-24 00:55:55,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:55,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2020-10-24 00:55:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 00:55:55,553 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 56 states. [2020-10-24 00:56:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:07,460 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2020-10-24 00:56:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2020-10-24 00:56:07,461 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 225 [2020-10-24 00:56:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:07,463 INFO L225 Difference]: With dead ends: 164 [2020-10-24 00:56:07,463 INFO L226 Difference]: Without dead ends: 157 [2020-10-24 00:56:07,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3055 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=503, Invalid=17587, Unknown=0, NotChecked=0, Total=18090 [2020-10-24 00:56:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-24 00:56:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-10-24 00:56:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-24 00:56:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2020-10-24 00:56:07,493 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 225 [2020-10-24 00:56:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:07,493 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2020-10-24 00:56:07,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2020-10-24 00:56:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2020-10-24 00:56:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-10-24 00:56:07,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:56:07,495 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 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:07,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 00:56:07,496 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:56:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:56:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -568773751, now seen corresponding path program 26 times [2020-10-24 00:56:07,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:56:07,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966106894] [2020-10-24 00:56:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:56:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:56:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:56:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:07,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:08,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:56:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:56:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1625 proven. 52 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2020-10-24 00:56:09,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966106894] [2020-10-24 00:56:09,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:56:09,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2020-10-24 00:56:09,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966490532] [2020-10-24 00:56:09,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-10-24 00:56:09,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:56:09,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-10-24 00:56:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:56:09,686 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 32 states. [2020-10-24 00:56:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:56:12,027 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2020-10-24 00:56:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-10-24 00:56:12,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 233 [2020-10-24 00:56:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:56:12,029 INFO L225 Difference]: With dead ends: 157 [2020-10-24 00:56:12,029 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:56:12,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1206, Invalid=2454, Unknown=0, NotChecked=0, Total=3660 [2020-10-24 00:56:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:56:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:56:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:56:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:56:12,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2020-10-24 00:56:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:56:12,031 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:56:12,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-10-24 00:56:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:56:12,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:56:12,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-24 00:56:12,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:56:12,336 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 117 [2020-10-24 00:56:12,645 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 117 [2020-10-24 00:56:12,926 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2020-10-24 00:56:13,148 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 113 [2020-10-24 00:56:13,468 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 117 [2020-10-24 00:56:14,957 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 210 DAG size of output: 161 [2020-10-24 00:56:16,384 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 210 DAG size of output: 161 [2020-10-24 00:56:17,760 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 205 DAG size of output: 160 [2020-10-24 00:56:19,035 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 205 DAG size of output: 160 [2020-10-24 00:56:20,664 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 256 DAG size of output: 208 [2020-10-24 00:56:20,671 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,671 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,672 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,672 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:56:20,673 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,673 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:56:20,674 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 25 main_~input~0) [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0)) [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 25 main_~input~0) (<= main_~input~0 25)) [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= 25 |main_#t~ret8|)) [2020-10-24 00:56:20,674 INFO L270 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 25 main_~input~0) [2020-10-24 00:56:20,675 INFO L270 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= 25 |main_#t~ret8|)) [2020-10-24 00:56:20,675 INFO L270 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 25) (<= 25 main_~input~0) (<= main_~result~0 25) (< 24 main_~result~0) (<= 25 |main_#t~ret8|)) [2020-10-24 00:56:20,675 INFO L270 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|)) (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) [2020-10-24 00:56:20,675 INFO L270 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) .cse0 (<= |id_#in~x| 15) (<= |id_#res| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|)) (and .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= |id_#in~x| 19) (<= 19 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= 23 |id_#res|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= 25 |id_#res|)) (and .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) .cse0 (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#res| 21)))) [2020-10-24 00:56:20,676 INFO L270 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-24 00:56:20,676 INFO L277 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-10-24 00:56:20,676 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-24 00:56:20,676 INFO L270 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|)) (and .cse0 (<= 26 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 24)))) (or (and (<= 12 |id_#in~x|) (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) (<= 12 |id_#t~ret7|)) (and (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (<= 25 |id_#in~x|) (and (<= |id_#t~ret7| 23) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 22 |id_#t~ret7|) (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= |id_#t~ret7| 20) (<= 20 |id_#t~ret7|)) (and (<= 1 |id_#in~x|) (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= |id_#t~ret7| 19) (<= |id_#in~x| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)))) [2020-10-24 00:56:20,676 INFO L270 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-10-24 00:56:20,677 INFO L270 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (and (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|)) (and .cse0 (<= 26 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 24)))) (or (and (<= 12 |id_#in~x|) (<= |id_#in~x| 12) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) (<= 12 |id_#t~ret7|)) (and (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 3 |id_#in~x|) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) (<= 13 |id_#t~ret7|) (<= |id_#in~x| 14)) (<= 25 |id_#in~x|) (and (<= |id_#t~ret7| 23) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|)) (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 22 |id_#t~ret7|) (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22)) (and (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= |id_#t~ret7| 20) (<= 20 |id_#t~ret7|)) (and (<= 1 |id_#in~x|) (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= |id_#t~ret7| 19) (<= |id_#in~x| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)))) [2020-10-24 00:56:20,677 INFO L270 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 25 |id_#in~x|) .cse0 (<= |id_#res| 25) (<= |id_#t~ret7| 24) (<= 24 |id_#t~ret7|) (<= 25 |id_#res|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= 15 |id_#res|) (<= 15 |id_#in~x|) (<= |id_#t~ret7| 14) .cse0 (<= |id_#in~x| 15) (<= 14 |id_#t~ret7|) (<= |id_#res| 15)) (and (<= |id_#in~x| 21) (<= 21 |id_#in~x|) (<= 21 |id_#res|) .cse0 (<= |id_#t~ret7| 20) (<= |id_#res| 21) (<= 20 |id_#t~ret7|)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= |id_#t~ret7| 23) .cse0 (<= |id_#in~x| 24) (<= |id_#res| 24) (<= 23 |id_#t~ret7|) (<= 24 |id_#in~x|) (<= 24 |id_#res|)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and .cse0 (<= |id_#in~x| 10) (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 12 |id_#in~x|) .cse0 (<= |id_#res| 12) (<= |id_#in~x| 12) (<= 12 |id_#res|) (<= |id_#t~ret7| 11) (<= 11 |id_#t~ret7|)) (and (<= 21 |id_#t~ret7|) (<= |id_#t~ret7| 21) .cse0 (<= 22 |id_#res|) (<= |id_#res| 22) (<= |id_#in~x| 22) (<= 22 |id_#in~x|)) (and (<= |id_#res| 18) (<= 18 |id_#in~x|) (<= |id_#t~ret7| 17) .cse0 (<= 18 |id_#res|) (<= |id_#in~x| 18) (<= 17 |id_#t~ret7|)) (and (<= 19 |id_#res|) (<= |id_#res| 19) .cse0 (<= 18 |id_#t~ret7|) (<= |id_#in~x| 19) (<= |id_#t~ret7| 18) (<= 19 |id_#in~x|)) (and (<= |id_#t~ret7| 10) (<= 10 |id_#t~ret7|) (<= |id_#in~x| 11) (<= 11 |id_#in~x|) .cse0 (<= |id_#res| 11) (<= 11 |id_#res|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= 22 |id_#t~ret7|) (<= |id_#res| 23) .cse0 (<= 23 |id_#in~x|) (<= |id_#in~x| 23) (<= |id_#t~ret7| 22) (<= 23 |id_#res|)) (and .cse0 (<= 26 |id_#in~x|)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#t~ret7| 19) .cse0 (<= |id_#in~x| 20) (<= 20 |id_#res|) (<= |id_#res| 20) (<= 20 |id_#in~x|) (<= 19 |id_#t~ret7|)) (and (<= |id_#res| 17) (<= 17 |id_#res|) .cse0 (<= |id_#t~ret7| 16) (<= 16 |id_#t~ret7|) (<= |id_#in~x| 17) (<= 17 |id_#in~x|)) (and (<= 13 |id_#in~x|) (<= |id_#in~x| 13) (<= |id_#t~ret7| 12) .cse0 (<= |id_#res| 13) (<= 13 |id_#res|) (<= 12 |id_#t~ret7|)) (and (<= |id_#res| 14) (<= 14 |id_#in~x|) (<= |id_#t~ret7| 13) .cse0 (<= 13 |id_#t~ret7|) (<= 14 |id_#res|) (<= |id_#in~x| 14)) (and (<= |id_#res| 16) .cse0 (<= 16 |id_#in~x|) (<= |id_#in~x| 16) (<= 16 |id_#res|) (<= 15 |id_#t~ret7|) (<= |id_#t~ret7| 15)) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)))) [2020-10-24 00:56:20,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:56:20 BoogieIcfgContainer [2020-10-24 00:56:20,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:56:20,708 INFO L168 Benchmark]: Toolchain (without parser) took 71230.88 ms. Allocated memory was 157.3 MB in the beginning and 679.5 MB in the end (delta: 522.2 MB). Free memory was 134.0 MB in the beginning and 538.8 MB in the end (delta: -404.9 MB). Peak memory consumption was 407.3 MB. Max. memory is 8.0 GB. [2020-10-24 00:56:20,709 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory is still 97.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:56:20,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.25 ms. Allocated memory is still 157.3 MB. Free memory was 133.2 MB in the beginning and 124.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:56:20,710 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 ms. Allocated memory is still 157.3 MB. Free memory was 124.0 MB in the beginning and 122.7 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:56:20,710 INFO L168 Benchmark]: RCFGBuilder took 603.18 ms. Allocated memory is still 157.3 MB. Free memory was 122.6 MB in the beginning and 135.5 MB in the end (delta: -12.9 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:56:20,711 INFO L168 Benchmark]: TraceAbstraction took 70344.65 ms. Allocated memory was 157.3 MB in the beginning and 679.5 MB in the end (delta: 522.2 MB). Free memory was 135.1 MB in the beginning and 538.8 MB in the end (delta: -403.7 MB). Peak memory consumption was 407.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:56:20,713 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.21 ms. Allocated memory is still 125.8 MB. Free memory is still 97.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 230.25 ms. Allocated memory is still 157.3 MB. Free memory was 133.2 MB in the beginning and 124.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.44 ms. Allocated memory is still 157.3 MB. Free memory was 124.0 MB in the beginning and 122.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 603.18 ms. Allocated memory is still 157.3 MB. Free memory was 122.6 MB in the beginning and 135.5 MB in the end (delta: -12.9 MB). Peak memory consumption was 12.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 70344.65 ms. Allocated memory was 157.3 MB in the beginning and 679.5 MB in the end (delta: 522.2 MB). Free memory was 135.1 MB in the beginning and 538.8 MB in the end (delta: -403.7 MB). Peak memory consumption was 407.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 25 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: (((((((((((((((((((((((((((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7) || ((((\old(x) <= 11 && 11 <= \old(x)) && \old(x) == x) && \result <= 11) && 11 <= \result)) || ((((\old(x) == x && \old(x) <= 10) && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((\result <= 16 && \old(x) == x) && 16 <= \old(x)) && \old(x) <= 16) && 16 <= \result)) || ((((15 <= \result && 15 <= \old(x)) && \old(x) == x) && \old(x) <= 15) && \result <= 15)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || ((((13 <= \old(x) && \old(x) <= 13) && \old(x) == x) && \result <= 13) && 13 <= \result)) || ((((\old(x) == x && 22 <= \result) && \result <= 22) && \old(x) <= 22) && 22 <= \old(x))) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((\old(x) == x && \old(x) <= 24) && \result <= 24) && 24 <= \old(x)) && 24 <= \result)) || ((((19 <= \result && \result <= 19) && \old(x) == x) && \old(x) <= 19) && 19 <= \old(x))) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1)) || (\old(x) == x && 26 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || ((((\result <= 23 && \old(x) == x) && 23 <= \old(x)) && \old(x) <= 23) && 23 <= \result)) || ((((\result <= 17 && 17 <= \result) && \old(x) == x) && \old(x) <= 17) && 17 <= \old(x))) || (((25 <= \old(x) && \old(x) == x) && \result <= 25) && 25 <= \result)) || ((((\old(x) == x && \old(x) <= 20) && 20 <= \result) && \result <= 20) && 20 <= \old(x))) || ((((\result <= 14 && 14 <= \old(x)) && \old(x) == x) && 14 <= \result) && \old(x) <= 14)) || ((((12 <= \old(x) && \old(x) == x) && \result <= 12) && \old(x) <= 12) && 12 <= \result)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 18 && 18 <= \old(x)) && \old(x) == x) && 18 <= \result) && \old(x) <= 18)) || ((((\old(x) <= 21 && 21 <= \old(x)) && 21 <= \result) && \old(x) == x) && \result <= 21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 61.5s, OverallIterations: 27, TraceHistogramMax: 27, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 3301 SDslu, 2556 SDs, 0 SdLazy, 11161 SolverSat, 947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1778 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 967 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 32.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=26, 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, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 150 PreInvPairs, 659 NumberOfFragments, 2178 HoareAnnotationTreeSize, 150 FomulaSimplifications, 11251 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 37 FomulaSimplificationsInter, 9371 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 3483 NumberOfCodeBlocks, 3483 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3456 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 1 PerfectInterpolantSequences, 11102/24804 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...