/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 true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 22:41:18,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 22:41:18,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 22:41:18,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 22:41:18,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 22:41:18,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 22:41:18,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 22:41:18,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 22:41:18,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 22:41:18,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 22:41:18,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 22:41:18,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 22:41:18,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 22:41:18,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 22:41:18,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 22:41:18,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 22:41:18,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 22:41:18,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 22:41:18,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 22:41:18,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 22:41:18,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 22:41:18,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 22:41:18,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 22:41:18,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 22:41:18,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 22:41:18,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 22:41:18,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 22:41:18,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 22:41:18,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 22:41:18,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 22:41:18,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 22:41:18,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 22:41:18,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 22:41:18,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 22:41:18,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 22:41:18,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 22:41:18,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 22:41:18,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 22:41:18,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 22:41:18,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 22:41:18,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 22:41:18,460 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-08-18 22:41:18,482 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 22:41:18,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 22:41:18,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 22:41:18,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 22:41:18,484 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 22:41:18,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 22:41:18,485 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 22:41:18,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 22:41:18,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 22:41:18,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 22:41:18,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 22:41:18,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 22:41:18,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 22:41:18,486 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 22:41:18,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 22:41:18,487 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 22:41:18,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 22:41:18,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 22:41:18,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 22:41:18,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 22:41:18,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 22:41:18,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 22:41:18,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 22:41:18,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 22:41:18,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 22:41:18,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 22:41:18,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 22:41:18,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 22:41:18,489 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 22:41:18,489 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDEST; [2020-08-18 22:41:18,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 22:41:18,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 22:41:18,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 22:41:18,846 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 22:41:18,847 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 22:41:18,848 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-18 22:41:18,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e62a422e/f65caa7d5144494b8a1b6f50766e3bb2/FLAGbe4bdbf35 [2020-08-18 22:41:19,408 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 22:41:19,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-18 22:41:19,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e62a422e/f65caa7d5144494b8a1b6f50766e3bb2/FLAGbe4bdbf35 [2020-08-18 22:41:19,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e62a422e/f65caa7d5144494b8a1b6f50766e3bb2 [2020-08-18 22:41:19,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 22:41:19,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 22:41:19,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 22:41:19,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 22:41:19,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 22:41:19,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 10:41:19" (1/1) ... [2020-08-18 22:41:19,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6920a351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:19, skipping insertion in model container [2020-08-18 22:41:19,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 10:41:19" (1/1) ... [2020-08-18 22:41:19,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 22:41:19,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 22:41:20,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 22:41:20,046 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 22:41:20,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 22:41:20,070 INFO L208 MainTranslator]: Completed translation [2020-08-18 22:41:20,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20 WrapperNode [2020-08-18 22:41:20,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 22:41:20,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 22:41:20,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 22:41:20,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 22:41:20,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (1/1) ... [2020-08-18 22:41:20,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 22:41:20,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 22:41:20,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 22:41:20,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 22:41:20,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (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-08-18 22:41:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 22:41:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 22:41:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-18 22:41:20,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 22:41:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 22:41:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 22:41:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-18 22:41:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 22:41:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 22:41:20,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 22:41:20,411 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 22:41:20,412 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 22:41:20,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 10:41:20 BoogieIcfgContainer [2020-08-18 22:41:20,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 22:41:20,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 22:41:20,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 22:41:20,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 22:41:20,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 10:41:19" (1/3) ... [2020-08-18 22:41:20,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 10:41:20, skipping insertion in model container [2020-08-18 22:41:20,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:20" (2/3) ... [2020-08-18 22:41:20,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 10:41:20, skipping insertion in model container [2020-08-18 22:41:20,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 10:41:20" (3/3) ... [2020-08-18 22:41:20,425 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-18 22:41:20,437 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 22:41:20,445 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 22:41:20,461 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 22:41:20,530 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 22:41:20,531 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 22:41:20,531 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 22:41:20,531 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 22:41:20,531 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 22:41:20,531 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 22:41:20,532 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 22:41:20,534 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 22:41:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-18 22:41:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 22:41:20,571 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:20,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:20,572 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-18 22:41:20,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:20,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783240600] [2020-08-18 22:41:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:20,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:20,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 22:41:20,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783240600] [2020-08-18 22:41:20,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 22:41:20,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 22:41:20,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313037726] [2020-08-18 22:41:20,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 22:41:20,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 22:41:20,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 22:41:20,822 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-18 22:41:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:20,925 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 22:41:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 22:41:20,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 22:41:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:20,938 INFO L225 Difference]: With dead ends: 35 [2020-08-18 22:41:20,938 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 22:41:20,942 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-08-18 22:41:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 22:41:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 22:41:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 22:41:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 22:41:20,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 22:41:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:20,993 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 22:41:20,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 22:41:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 22:41:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 22:41:20,996 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:20,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:20,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 22:41:20,997 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:20,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-18 22:41:20,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:20,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1127637187] [2020-08-18 22:41:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 22:41:21,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1127637187] [2020-08-18 22:41:21,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 22:41:21,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 22:41:21,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327366396] [2020-08-18 22:41:21,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 22:41:21,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 22:41:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 22:41:21,076 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 22:41:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:21,139 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 22:41:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 22:41:21,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 22:41:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:21,141 INFO L225 Difference]: With dead ends: 27 [2020-08-18 22:41:21,142 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 22:41:21,143 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-08-18 22:41:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 22:41:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 22:41:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 22:41:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 22:41:21,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 22:41:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:21,152 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 22:41:21,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 22:41:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 22:41:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 22:41:21,154 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:21,154 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:21,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 22:41:21,155 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-18 22:41:21,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:21,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021920205] [2020-08-18 22:41:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 22:41:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-18 22:41:21,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021920205] [2020-08-18 22:41:21,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:21,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 22:41:21,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539282129] [2020-08-18 22:41:21,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 22:41:21,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 22:41:21,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 22:41:21,313 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-18 22:41:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:21,405 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 22:41:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 22:41:21,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-18 22:41:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:21,407 INFO L225 Difference]: With dead ends: 38 [2020-08-18 22:41:21,407 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 22:41:21,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-18 22:41:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 22:41:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 22:41:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 22:41:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 22:41:21,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 22:41:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:21,416 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 22:41:21,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 22:41:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 22:41:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 22:41:21,418 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:21,419 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:21,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 22:41:21,419 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-18 22:41:21,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:21,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [109571990] [2020-08-18 22:41:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-18 22:41:21,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [109571990] [2020-08-18 22:41:21,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:21,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 22:41:21,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721651495] [2020-08-18 22:41:21,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 22:41:21,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 22:41:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 22:41:21,580 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 22:41:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:21,694 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 22:41:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 22:41:21,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 22:41:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:21,697 INFO L225 Difference]: With dead ends: 41 [2020-08-18 22:41:21,697 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 22:41:21,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-18 22:41:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 22:41:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 22:41:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 22:41:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 22:41:21,710 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 22:41:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:21,710 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 22:41:21,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 22:41:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 22:41:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 22:41:21,712 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:21,712 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:21,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 22:41:21,713 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-18 22:41:21,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:21,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [453088510] [2020-08-18 22:41:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-18 22:41:21,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [453088510] [2020-08-18 22:41:21,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:21,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 22:41:21,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526356779] [2020-08-18 22:41:21,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 22:41:21,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 22:41:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-18 22:41:21,882 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-18 22:41:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:22,020 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-18 22:41:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 22:41:22,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-18 22:41:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:22,024 INFO L225 Difference]: With dead ends: 79 [2020-08-18 22:41:22,024 INFO L226 Difference]: Without dead ends: 48 [2020-08-18 22:41:22,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-18 22:41:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-18 22:41:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-18 22:41:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-18 22:41:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-18 22:41:22,038 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-18 22:41:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:22,038 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-18 22:41:22,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 22:41:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-18 22:41:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 22:41:22,040 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:22,041 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:22,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 22:41:22,041 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:22,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-18 22:41:22,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:22,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278879554] [2020-08-18 22:41:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-18 22:41:22,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278879554] [2020-08-18 22:41:22,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:22,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 22:41:22,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341334424] [2020-08-18 22:41:22,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 22:41:22,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:22,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 22:41:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 22:41:22,156 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-18 22:41:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:22,266 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-18 22:41:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 22:41:22,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 22:41:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:22,269 INFO L225 Difference]: With dead ends: 65 [2020-08-18 22:41:22,269 INFO L226 Difference]: Without dead ends: 61 [2020-08-18 22:41:22,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 22:41:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-18 22:41:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-18 22:41:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-18 22:41:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-18 22:41:22,285 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-18 22:41:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:22,285 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-18 22:41:22,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 22:41:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-18 22:41:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-18 22:41:22,289 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:22,290 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:22,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 22:41:22,290 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-18 22:41:22,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:22,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153013676] [2020-08-18 22:41:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-08-18 22:41:22,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153013676] [2020-08-18 22:41:22,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:22,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 22:41:22,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159679741] [2020-08-18 22:41:22,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 22:41:22,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 22:41:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-18 22:41:22,601 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-18 22:41:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:22,926 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-18 22:41:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-18 22:41:22,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-18 22:41:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:22,930 INFO L225 Difference]: With dead ends: 107 [2020-08-18 22:41:22,932 INFO L226 Difference]: Without dead ends: 57 [2020-08-18 22:41:22,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-08-18 22:41:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-18 22:41:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-18 22:41:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-18 22:41:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-18 22:41:22,967 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-18 22:41:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:22,967 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-18 22:41:22,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 22:41:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-18 22:41:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-18 22:41:22,973 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:22,974 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:22,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 22:41:22,974 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-18 22:41:22,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:22,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325390948] [2020-08-18 22:41:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-08-18 22:41:23,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325390948] [2020-08-18 22:41:23,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:23,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-18 22:41:23,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603258765] [2020-08-18 22:41:23,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-18 22:41:23,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-18 22:41:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-18 22:41:23,351 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-18 22:41:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:23,793 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-18 22:41:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-18 22:41:23,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-18 22:41:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:23,796 INFO L225 Difference]: With dead ends: 115 [2020-08-18 22:41:23,796 INFO L226 Difference]: Without dead ends: 74 [2020-08-18 22:41:23,797 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-18 22:41:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-18 22:41:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-18 22:41:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-18 22:41:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-18 22:41:23,809 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-18 22:41:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:23,810 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-18 22:41:23,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-18 22:41:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-18 22:41:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 22:41:23,813 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:23,813 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:23,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 22:41:23,813 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-18 22:41:23,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:23,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [990530184] [2020-08-18 22:41:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:23,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-18 22:41:24,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [990530184] [2020-08-18 22:41:24,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:24,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 22:41:24,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617922257] [2020-08-18 22:41:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 22:41:24,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 22:41:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 22:41:24,256 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-18 22:41:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:24,466 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-18 22:41:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 22:41:24,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 22:41:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:24,471 INFO L225 Difference]: With dead ends: 186 [2020-08-18 22:41:24,471 INFO L226 Difference]: Without dead ends: 182 [2020-08-18 22:41:24,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 22:41:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-18 22:41:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-18 22:41:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-18 22:41:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-18 22:41:24,496 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-18 22:41:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:24,497 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-18 22:41:24,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 22:41:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-18 22:41:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-18 22:41:24,501 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:24,501 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:24,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 22:41:24,502 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-18 22:41:24,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:24,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390868594] [2020-08-18 22:41:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:24,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-08-18 22:41:25,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390868594] [2020-08-18 22:41:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:25,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-18 22:41:25,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002308784] [2020-08-18 22:41:25,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-18 22:41:25,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-18 22:41:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-18 22:41:25,655 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-18 22:41:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:26,522 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-18 22:41:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-18 22:41:26,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-18 22:41:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:26,526 INFO L225 Difference]: With dead ends: 281 [2020-08-18 22:41:26,526 INFO L226 Difference]: Without dead ends: 125 [2020-08-18 22:41:26,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-08-18 22:41:26,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-18 22:41:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-18 22:41:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-18 22:41:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-18 22:41:26,551 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-18 22:41:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:26,554 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-18 22:41:26,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-18 22:41:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-18 22:41:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-18 22:41:26,570 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:26,571 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:26,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 22:41:26,571 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-18 22:41:26,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:26,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017700712] [2020-08-18 22:41:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:26,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:26,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 22:41:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:27,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-18 22:41:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:28,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3272 proven. 3796 refuted. 0 times theorem prover too weak. 13923 trivial. 0 not checked. [2020-08-18 22:41:29,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017700712] [2020-08-18 22:41:29,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:29,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-18 22:41:29,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024862531] [2020-08-18 22:41:29,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-18 22:41:29,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-18 22:41:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-18 22:41:29,291 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-18 22:41:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:30,251 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-18 22:41:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-18 22:41:30,252 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-18 22:41:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:30,261 INFO L225 Difference]: With dead ends: 226 [2020-08-18 22:41:30,261 INFO L226 Difference]: Without dead ends: 136 [2020-08-18 22:41:30,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-18 22:41:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-18 22:41:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-18 22:41:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-18 22:41:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-18 22:41:30,291 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-18 22:41:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:30,292 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-18 22:41:30,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-18 22:41:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-18 22:41:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-18 22:41:30,320 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:30,320 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:30,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 22:41:30,321 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:30,321 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-18 22:41:30,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:30,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879323124] [2020-08-18 22:41:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:30,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:30,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:31,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 22:41:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-18 22:41:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:32,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-08-18 22:41:33,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879323124] [2020-08-18 22:41:33,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:33,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-18 22:41:33,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101754536] [2020-08-18 22:41:33,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-18 22:41:33,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-18 22:41:33,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-18 22:41:33,363 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-18 22:41:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:33,694 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-18 22:41:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-18 22:41:33,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-18 22:41:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:33,707 INFO L225 Difference]: With dead ends: 486 [2020-08-18 22:41:33,707 INFO L226 Difference]: Without dead ends: 482 [2020-08-18 22:41:33,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-18 22:41:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-18 22:41:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-18 22:41:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-18 22:41:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-18 22:41:33,765 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-18 22:41:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:33,766 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-18 22:41:33,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-18 22:41:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-18 22:41:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-18 22:41:33,779 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:33,780 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:33,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 22:41:33,780 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-18 22:41:33,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:33,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1760204022] [2020-08-18 22:41:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 22:41:34,419 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 22:41:34,419 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 22:41:34,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 22:41:34,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 10:41:34 BoogieIcfgContainer [2020-08-18 22:41:34,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 22:41:34,562 INFO L168 Benchmark]: Toolchain (without parser) took 14715.23 ms. Allocated memory was 140.5 MB in the beginning and 869.8 MB in the end (delta: 729.3 MB). Free memory was 103.9 MB in the beginning and 461.1 MB in the end (delta: -357.1 MB). Peak memory consumption was 645.9 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:34,564 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-18 22:41:34,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.10 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 94.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:34,566 INFO L168 Benchmark]: Boogie Preprocessor took 21.99 ms. Allocated memory is still 140.5 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:34,566 INFO L168 Benchmark]: RCFGBuilder took 322.01 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 93.0 MB in the beginning and 170.3 MB in the end (delta: -77.3 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:34,572 INFO L168 Benchmark]: TraceAbstraction took 14136.50 ms. Allocated memory was 202.4 MB in the beginning and 869.8 MB in the end (delta: 667.4 MB). Free memory was 169.7 MB in the beginning and 461.1 MB in the end (delta: -291.4 MB). Peak memory consumption was 649.7 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:34,584 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.10 ms. Allocated memory is still 140.5 MB. Free memory was 103.7 MB in the beginning and 94.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.99 ms. Allocated memory is still 140.5 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 322.01 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 93.0 MB in the beginning and 170.3 MB in the end (delta: -77.3 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14136.50 ms. Allocated memory was 202.4 MB in the beginning and 869.8 MB in the end (delta: 667.4 MB). Free memory was 169.7 MB in the beginning and 461.1 MB in the end (delta: -291.4 MB). Peak memory consumption was 649.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1807 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52623/63131 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 incorrect! Received shutdown request...