/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:05,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:05,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:05,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:05,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:05,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:05,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:05,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:05,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:05,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:05,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:05,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:05,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:05,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:05,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:05,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:05,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:05,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:05,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:05,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:05,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:05,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:05,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:05,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:05,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:05,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:05,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:05,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:05,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:05,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:05,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:05,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:05,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:05,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:05,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:05,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:05,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:05,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:05,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:05,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:05,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:05,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:19:05,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:05,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:05,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:05,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:05,595 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:05,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:05,595 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:05,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:05,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:05,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:05,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:05,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:05,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:05,597 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:05,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:05,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:05,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:05,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:05,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:05,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:05,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:05,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:05,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:05,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:05,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:05,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:05,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:05,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:05,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:05,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-09-21 10:19:06,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:06,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:06,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:06,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:06,092 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:06,094 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-09-21 10:19:06,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0f7d7c81/c4946d87ef5f4e7480f81d47adff685b/FLAGa9b3c52ad [2020-09-21 10:19:06,744 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:06,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-09-21 10:19:06,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0f7d7c81/c4946d87ef5f4e7480f81d47adff685b/FLAGa9b3c52ad [2020-09-21 10:19:07,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b0f7d7c81/c4946d87ef5f4e7480f81d47adff685b [2020-09-21 10:19:07,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:07,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:07,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:07,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:07,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:07,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240fc400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07, skipping insertion in model container [2020-09-21 10:19:07,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:07,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:07,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:07,396 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:07,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:07,438 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:07,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07 WrapperNode [2020-09-21 10:19:07,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:07,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:07,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:07,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:07,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... [2020-09-21 10:19:07,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:07,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:07,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:07,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:07,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-21 10:19:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-21 10:19:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-21 10:19:07,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:19:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-21 10:19:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-21 10:19:07,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:07,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:07,946 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:07,946 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:07,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:07 BoogieIcfgContainer [2020-09-21 10:19:07,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:07,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:07,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:07,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:07,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:07" (1/3) ... [2020-09-21 10:19:07,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71686d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:07, skipping insertion in model container [2020-09-21 10:19:07,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:07" (2/3) ... [2020-09-21 10:19:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71686d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:07, skipping insertion in model container [2020-09-21 10:19:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:07" (3/3) ... [2020-09-21 10:19:07,989 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-09-21 10:19:08,008 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:08,017 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:08,037 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:08,070 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:08,070 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:08,070 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:08,070 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:08,070 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:08,071 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:08,071 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:08,071 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-09-21 10:19:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:08,105 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:08,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:08,107 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:08,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-09-21 10:19:08,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:08,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1026851223] [2020-09-21 10:19:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:08,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1026851223] [2020-09-21 10:19:08,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:08,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:08,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390744717] [2020-09-21 10:19:08,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:08,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:08,417 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-09-21 10:19:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:08,541 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-09-21 10:19:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:08,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:08,559 INFO L225 Difference]: With dead ends: 44 [2020-09-21 10:19:08,560 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:19:08,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:19:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:19:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-09-21 10:19:08,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-09-21 10:19:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:08,633 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-09-21 10:19:08,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-09-21 10:19:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-21 10:19:08,636 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:08,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:08,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:08,637 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-09-21 10:19:08,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:08,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396175001] [2020-09-21 10:19:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:08,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396175001] [2020-09-21 10:19:08,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:08,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:08,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727986870] [2020-09-21 10:19:08,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:08,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:08,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:08,739 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-09-21 10:19:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:08,819 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-09-21 10:19:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:08,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-21 10:19:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:08,822 INFO L225 Difference]: With dead ends: 36 [2020-09-21 10:19:08,822 INFO L226 Difference]: Without dead ends: 32 [2020-09-21 10:19:08,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-21 10:19:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-09-21 10:19:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-09-21 10:19:08,834 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-09-21 10:19:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:08,834 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-09-21 10:19:08,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-09-21 10:19:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:19:08,836 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:08,837 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:08,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:08,838 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-09-21 10:19:08,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:08,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905521492] [2020-09-21 10:19:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:08,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-21 10:19:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:19:09,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905521492] [2020-09-21 10:19:09,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:09,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:09,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739881325] [2020-09-21 10:19:09,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:09,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:09,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:09,048 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2020-09-21 10:19:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:09,173 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-09-21 10:19:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:09,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-09-21 10:19:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:09,176 INFO L225 Difference]: With dead ends: 58 [2020-09-21 10:19:09,177 INFO L226 Difference]: Without dead ends: 34 [2020-09-21 10:19:09,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-09-21 10:19:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-09-21 10:19:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-21 10:19:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-09-21 10:19:09,199 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-09-21 10:19:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:09,200 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-09-21 10:19:09,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-09-21 10:19:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:19:09,206 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:09,206 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] [2020-09-21 10:19:09,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:09,207 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-09-21 10:19:09,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:09,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227427743] [2020-09-21 10:19:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 10:19:09,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227427743] [2020-09-21 10:19:09,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:09,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:09,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737529395] [2020-09-21 10:19:09,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:09,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:09,408 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2020-09-21 10:19:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:09,632 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-09-21 10:19:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:09,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-09-21 10:19:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:09,641 INFO L225 Difference]: With dead ends: 54 [2020-09-21 10:19:09,642 INFO L226 Difference]: Without dead ends: 50 [2020-09-21 10:19:09,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-21 10:19:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-09-21 10:19:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:19:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-09-21 10:19:09,669 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-09-21 10:19:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:09,670 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-09-21 10:19:09,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-09-21 10:19:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-21 10:19:09,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:09,674 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:09,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:09,675 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-09-21 10:19:09,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:09,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188151280] [2020-09-21 10:19:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-21 10:19:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-21 10:19:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-21 10:19:09,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188151280] [2020-09-21 10:19:09,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:09,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:09,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177679250] [2020-09-21 10:19:09,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:09,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:09,846 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2020-09-21 10:19:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:09,922 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2020-09-21 10:19:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:19:09,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-09-21 10:19:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:09,925 INFO L225 Difference]: With dead ends: 94 [2020-09-21 10:19:09,925 INFO L226 Difference]: Without dead ends: 52 [2020-09-21 10:19:09,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-09-21 10:19:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-09-21 10:19:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-21 10:19:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2020-09-21 10:19:09,938 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 39 [2020-09-21 10:19:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:09,938 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2020-09-21 10:19:09,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2020-09-21 10:19:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-21 10:19:09,941 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:09,941 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:09,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:09,942 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-09-21 10:19:09,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:09,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1766271185] [2020-09-21 10:19:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-21 10:19:10,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1766271185] [2020-09-21 10:19:10,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:10,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:10,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170174781] [2020-09-21 10:19:10,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:10,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:10,129 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 8 states. [2020-09-21 10:19:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:10,261 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. [2020-09-21 10:19:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:19:10,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-21 10:19:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:10,264 INFO L225 Difference]: With dead ends: 103 [2020-09-21 10:19:10,264 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:19:10,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:19:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-09-21 10:19:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:19:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2020-09-21 10:19:10,277 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 40 [2020-09-21 10:19:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:10,278 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-09-21 10:19:10,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2020-09-21 10:19:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-21 10:19:10,280 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:10,281 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:10,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:10,281 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 208191613, now seen corresponding path program 1 times [2020-09-21 10:19:10,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:10,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228018613] [2020-09-21 10:19:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-21 10:19:10,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228018613] [2020-09-21 10:19:10,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:10,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:10,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258006485] [2020-09-21 10:19:10,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:10,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:10,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:10,421 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 8 states. [2020-09-21 10:19:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:10,655 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2020-09-21 10:19:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:19:10,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-09-21 10:19:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:10,659 INFO L225 Difference]: With dead ends: 86 [2020-09-21 10:19:10,662 INFO L226 Difference]: Without dead ends: 82 [2020-09-21 10:19:10,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-21 10:19:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-09-21 10:19:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-21 10:19:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2020-09-21 10:19:10,687 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 41 [2020-09-21 10:19:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:10,687 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2020-09-21 10:19:10,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2020-09-21 10:19:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-21 10:19:10,692 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:10,692 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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] [2020-09-21 10:19:10,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:10,692 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-09-21 10:19:10,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:10,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1490266953] [2020-09-21 10:19:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-21 10:19:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-09-21 10:19:10,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1490266953] [2020-09-21 10:19:10,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:10,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:10,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068967273] [2020-09-21 10:19:10,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:10,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:10,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:10,902 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand 8 states. [2020-09-21 10:19:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:11,043 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2020-09-21 10:19:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:11,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-09-21 10:19:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:11,046 INFO L225 Difference]: With dead ends: 167 [2020-09-21 10:19:11,047 INFO L226 Difference]: Without dead ends: 94 [2020-09-21 10:19:11,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-21 10:19:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2020-09-21 10:19:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-09-21 10:19:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2020-09-21 10:19:11,066 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 54 [2020-09-21 10:19:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:11,067 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2020-09-21 10:19:11,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2020-09-21 10:19:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:19:11,069 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:11,069 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 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] [2020-09-21 10:19:11,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:11,070 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2020-09-21 10:19:11,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:11,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1447183645] [2020-09-21 10:19:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-21 10:19:11,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1447183645] [2020-09-21 10:19:11,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:11,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:11,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692541371] [2020-09-21 10:19:11,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:11,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:11,253 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand 10 states. [2020-09-21 10:19:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:11,477 INFO L93 Difference]: Finished difference Result 188 states and 331 transitions. [2020-09-21 10:19:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:19:11,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-09-21 10:19:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:11,480 INFO L225 Difference]: With dead ends: 188 [2020-09-21 10:19:11,480 INFO L226 Difference]: Without dead ends: 109 [2020-09-21 10:19:11,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-21 10:19:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2020-09-21 10:19:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-21 10:19:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2020-09-21 10:19:11,515 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 55 [2020-09-21 10:19:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:11,516 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2020-09-21 10:19:11,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2020-09-21 10:19:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-21 10:19:11,518 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:11,518 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:11,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:11,519 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:11,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:11,519 INFO L82 PathProgramCache]: Analyzing trace with hash -908952008, now seen corresponding path program 2 times [2020-09-21 10:19:11,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:11,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [989808136] [2020-09-21 10:19:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 30 proven. 52 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-09-21 10:19:11,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [989808136] [2020-09-21 10:19:11,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:11,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:11,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771348322] [2020-09-21 10:19:11,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:11,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:11,785 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 12 states. [2020-09-21 10:19:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:12,205 INFO L93 Difference]: Finished difference Result 199 states and 354 transitions. [2020-09-21 10:19:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:19:12,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-09-21 10:19:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:12,213 INFO L225 Difference]: With dead ends: 199 [2020-09-21 10:19:12,214 INFO L226 Difference]: Without dead ends: 86 [2020-09-21 10:19:12,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:19:12,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-21 10:19:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2020-09-21 10:19:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-09-21 10:19:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2020-09-21 10:19:12,246 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 82 [2020-09-21 10:19:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:12,246 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2020-09-21 10:19:12,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2020-09-21 10:19:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-09-21 10:19:12,249 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:12,252 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:12,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:12,252 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2119203654, now seen corresponding path program 2 times [2020-09-21 10:19:12,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:12,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012540398] [2020-09-21 10:19:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-21 10:19:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-09-21 10:19:12,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012540398] [2020-09-21 10:19:12,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:12,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:12,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180510690] [2020-09-21 10:19:12,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:12,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:12,578 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 10 states. [2020-09-21 10:19:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:12,782 INFO L93 Difference]: Finished difference Result 142 states and 204 transitions. [2020-09-21 10:19:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:19:12,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2020-09-21 10:19:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:12,784 INFO L225 Difference]: With dead ends: 142 [2020-09-21 10:19:12,784 INFO L226 Difference]: Without dead ends: 78 [2020-09-21 10:19:12,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-21 10:19:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-21 10:19:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-21 10:19:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2020-09-21 10:19:12,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 110 [2020-09-21 10:19:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:12,795 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2020-09-21 10:19:12,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2020-09-21 10:19:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-09-21 10:19:12,797 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:12,798 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 13, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:12,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:12,798 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:12,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1263382818, now seen corresponding path program 3 times [2020-09-21 10:19:12,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:12,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511402381] [2020-09-21 10:19:12,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:12,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:19:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-21 10:19:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-21 10:19:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 98 proven. 322 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2020-09-21 10:19:13,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511402381] [2020-09-21 10:19:13,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:13,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:13,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38888000] [2020-09-21 10:19:13,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:13,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:13,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:13,317 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 12 states. [2020-09-21 10:19:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:13,688 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2020-09-21 10:19:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:19:13,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 192 [2020-09-21 10:19:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:13,692 INFO L225 Difference]: With dead ends: 178 [2020-09-21 10:19:13,692 INFO L226 Difference]: Without dead ends: 109 [2020-09-21 10:19:13,694 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:19:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-09-21 10:19:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2020-09-21 10:19:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-21 10:19:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2020-09-21 10:19:13,715 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 192 [2020-09-21 10:19:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:13,717 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2020-09-21 10:19:13,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2020-09-21 10:19:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-09-21 10:19:13,723 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:13,724 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:13,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:19:13,724 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:13,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1677699577, now seen corresponding path program 1 times [2020-09-21 10:19:13,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:13,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [112098647] [2020-09-21 10:19:13,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:13,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 77 proven. 26 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-09-21 10:19:14,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [112098647] [2020-09-21 10:19:14,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:14,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:14,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070178951] [2020-09-21 10:19:14,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:14,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:14,051 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand 11 states. [2020-09-21 10:19:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:14,335 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2020-09-21 10:19:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:14,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2020-09-21 10:19:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:14,337 INFO L225 Difference]: With dead ends: 172 [2020-09-21 10:19:14,338 INFO L226 Difference]: Without dead ends: 94 [2020-09-21 10:19:14,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-21 10:19:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-21 10:19:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-21 10:19:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2020-09-21 10:19:14,361 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 96 [2020-09-21 10:19:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:14,363 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2020-09-21 10:19:14,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2020-09-21 10:19:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-09-21 10:19:14,366 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:14,366 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:14,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:19:14,367 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash 265701462, now seen corresponding path program 2 times [2020-09-21 10:19:14,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:14,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525374581] [2020-09-21 10:19:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-21 10:19:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 56 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-09-21 10:19:14,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [525374581] [2020-09-21 10:19:14,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:14,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:14,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022573882] [2020-09-21 10:19:14,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:14,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:14,660 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 12 states. [2020-09-21 10:19:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:15,028 INFO L93 Difference]: Finished difference Result 185 states and 262 transitions. [2020-09-21 10:19:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:19:15,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2020-09-21 10:19:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:15,030 INFO L225 Difference]: With dead ends: 185 [2020-09-21 10:19:15,031 INFO L226 Difference]: Without dead ends: 104 [2020-09-21 10:19:15,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2020-09-21 10:19:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-09-21 10:19:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2020-09-21 10:19:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-21 10:19:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2020-09-21 10:19:15,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 110 [2020-09-21 10:19:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:15,044 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2020-09-21 10:19:15,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2020-09-21 10:19:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-21 10:19:15,045 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:15,046 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:15,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:19:15,046 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 3 times [2020-09-21 10:19:15,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:15,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904223649] [2020-09-21 10:19:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2020-09-21 10:19:15,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904223649] [2020-09-21 10:19:15,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:15,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-21 10:19:15,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556515423] [2020-09-21 10:19:15,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-21 10:19:15,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-21 10:19:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:19:15,739 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 22 states. [2020-09-21 10:19:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:16,146 INFO L93 Difference]: Finished difference Result 105 states and 141 transitions. [2020-09-21 10:19:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-21 10:19:16,146 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2020-09-21 10:19:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:16,148 INFO L225 Difference]: With dead ends: 105 [2020-09-21 10:19:16,148 INFO L226 Difference]: Without dead ends: 101 [2020-09-21 10:19:16,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:19:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-09-21 10:19:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2020-09-21 10:19:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-21 10:19:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2020-09-21 10:19:16,158 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 109 [2020-09-21 10:19:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:16,159 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2020-09-21 10:19:16,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-21 10:19:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2020-09-21 10:19:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-21 10:19:16,161 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:16,161 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:16,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:19:16,162 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1650675485, now seen corresponding path program 4 times [2020-09-21 10:19:16,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:16,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1175773736] [2020-09-21 10:19:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 94 proven. 190 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-21 10:19:16,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1175773736] [2020-09-21 10:19:16,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:16,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:19:16,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423185956] [2020-09-21 10:19:16,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:19:16,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:16,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:19:16,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:16,576 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand 14 states. [2020-09-21 10:19:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:17,136 INFO L93 Difference]: Finished difference Result 208 states and 318 transitions. [2020-09-21 10:19:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:19:17,137 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 150 [2020-09-21 10:19:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:17,139 INFO L225 Difference]: With dead ends: 208 [2020-09-21 10:19:17,139 INFO L226 Difference]: Without dead ends: 113 [2020-09-21 10:19:17,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:19:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-21 10:19:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2020-09-21 10:19:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-21 10:19:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2020-09-21 10:19:17,150 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 150 [2020-09-21 10:19:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:17,151 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2020-09-21 10:19:17,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:19:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2020-09-21 10:19:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-09-21 10:19:17,153 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:17,154 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:17,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:19:17,154 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash 215516676, now seen corresponding path program 5 times [2020-09-21 10:19:17,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:17,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419997580] [2020-09-21 10:19:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-21 10:19:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 119 proven. 187 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2020-09-21 10:19:17,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419997580] [2020-09-21 10:19:17,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:17,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:17,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441652248] [2020-09-21 10:19:17,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:17,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:17,538 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand 11 states. [2020-09-21 10:19:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:17,845 INFO L93 Difference]: Finished difference Result 199 states and 275 transitions. [2020-09-21 10:19:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:17,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2020-09-21 10:19:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:17,847 INFO L225 Difference]: With dead ends: 199 [2020-09-21 10:19:17,847 INFO L226 Difference]: Without dead ends: 108 [2020-09-21 10:19:17,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-21 10:19:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2020-09-21 10:19:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-21 10:19:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2020-09-21 10:19:17,858 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 190 [2020-09-21 10:19:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:17,858 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2020-09-21 10:19:17,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2020-09-21 10:19:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-21 10:19:17,860 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:17,861 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:17,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-21 10:19:17,861 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:17,861 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 6 times [2020-09-21 10:19:17,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:17,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128969936] [2020-09-21 10:19:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:17,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:19:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:19:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:19:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:19:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:19:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:19:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 66 proven. 156 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2020-09-21 10:19:18,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128969936] [2020-09-21 10:19:18,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:18,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:18,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214077414] [2020-09-21 10:19:18,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:18,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:18,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:18,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:18,268 INFO L87 Difference]: Start difference. First operand 105 states and 137 transitions. Second operand 11 states. [2020-09-21 10:19:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:18,505 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2020-09-21 10:19:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:19:18,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 150 [2020-09-21 10:19:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:18,507 INFO L225 Difference]: With dead ends: 123 [2020-09-21 10:19:18,507 INFO L226 Difference]: Without dead ends: 0 [2020-09-21 10:19:18,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-21 10:19:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-21 10:19:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-21 10:19:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-21 10:19:18,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2020-09-21 10:19:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:18,511 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-21 10:19:18,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-21 10:19:18,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-21 10:19:18,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-21 10:19:18,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-21 10:19:19,887 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 23 [2020-09-21 10:19:20,324 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 24 [2020-09-21 10:19:20,328 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-21 10:19:20,328 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:19:20,329 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-21 10:19:20,329 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-21 10:19:20,329 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-21 10:19:20,329 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-21 10:19:20,329 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-09-21 10:19:20,329 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-21 10:19:20,330 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2020-09-21 10:19:20,330 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2020-09-21 10:19:20,330 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-09-21 10:19:20,330 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-09-21 10:19:20,330 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-09-21 10:19:20,330 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-09-21 10:19:20,330 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-09-21 10:19:20,331 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-21 10:19:20,331 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-21 10:19:20,331 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-09-21 10:19:20,332 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse1 (<= |fibo2_#in~n| 2))) (and (or (and .cse0 (<= 5 fibo2_~n)) (and (<= 4 fibo2_~n) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2) .cse0) .cse1) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|)) (not .cse1)))) [2020-09-21 10:19:20,332 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-09-21 10:19:20,332 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-09-21 10:19:20,332 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-09-21 10:19:20,333 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-09-21 10:19:20,333 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-09-21 10:19:20,333 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-21 10:19:20,334 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-09-21 10:19:20,334 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-09-21 10:19:20,334 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= 2 |fibo1_#in~n|) (or (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) (<= 4 |fibo1_#in~n|)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 3 |fibo1_#t~ret0|) .cse0 (<= |fibo1_#t~ret0| 3)) (and .cse0 (<= 6 |fibo1_#in~n|)) (and (<= fibo1_~n 4) .cse0)))) [2020-09-21 10:19:20,335 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-09-21 10:19:20,335 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-09-21 10:19:20,335 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-09-21 10:19:20,335 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-09-21 10:19:20,335 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-09-21 10:19:20,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:19:20 BoogieIcfgContainer [2020-09-21 10:19:20,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:19:20,347 INFO L168 Benchmark]: Toolchain (without parser) took 13246.57 ms. Allocated memory was 148.4 MB in the beginning and 395.3 MB in the end (delta: 246.9 MB). Free memory was 104.0 MB in the beginning and 262.4 MB in the end (delta: -158.4 MB). Peak memory consumption was 220.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:20,348 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:19:20,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.51 ms. Allocated memory is still 148.4 MB. Free memory was 103.4 MB in the beginning and 93.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:20,355 INFO L168 Benchmark]: Boogie Preprocessor took 143.59 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 93.7 MB in the beginning and 183.8 MB in the end (delta: -90.1 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:20,358 INFO L168 Benchmark]: RCFGBuilder took 368.20 ms. Allocated memory is still 205.0 MB. Free memory was 183.8 MB in the beginning and 170.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:20,359 INFO L168 Benchmark]: TraceAbstraction took 12382.49 ms. Allocated memory was 205.0 MB in the beginning and 395.3 MB in the end (delta: 190.3 MB). Free memory was 169.6 MB in the beginning and 262.4 MB in the end (delta: -92.7 MB). Peak memory consumption was 229.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:20,368 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.51 ms. Allocated memory is still 148.4 MB. Free memory was 103.4 MB in the beginning and 93.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.59 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 93.7 MB in the beginning and 183.8 MB in the end (delta: -90.1 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.20 ms. Allocated memory is still 205.0 MB. Free memory was 183.8 MB in the beginning and 170.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12382.49 ms. Allocated memory was 205.0 MB in the beginning and 395.3 MB in the end (delta: 190.3 MB). Free memory was 169.6 MB in the beginning and 262.4 MB in the end (delta: -92.7 MB). Peak memory consumption was 229.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.4s, OverallIterations: 18, TraceHistogramMax: 17, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 563 SDtfs, 507 SDslu, 3315 SDs, 0 SdLazy, 3071 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 724 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 545 PreInvPairs, 724 NumberOfFragments, 111 HoareAnnotationTreeSize, 545 FomulaSimplifications, 2493 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3928 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1498 NumberOfCodeBlocks, 1498 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 311578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 3047/4287 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...