/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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=HIGHLEXORDER --traceabstraction.additional.smt.options log-additional-information=true -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-177f698 [2020-08-21 18:54:58,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 18:54:58,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 18:54:58,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 18:54:58,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 18:54:58,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 18:54:58,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 18:54:58,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 18:54:58,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 18:54:58,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 18:54:58,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 18:54:58,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 18:54:58,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 18:54:58,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 18:54:58,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 18:54:58,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 18:54:58,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 18:54:58,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 18:54:58,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 18:54:58,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 18:54:58,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 18:54:58,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 18:54:58,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 18:54:58,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 18:54:58,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 18:54:58,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 18:54:58,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 18:54:58,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 18:54:58,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 18:54:58,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 18:54:58,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 18:54:58,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 18:54:58,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 18:54:58,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 18:54:58,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 18:54:58,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 18:54:58,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 18:54:58,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 18:54:58,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 18:54:58,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 18:54:58,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 18:54:58,730 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-21 18:54:58,774 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 18:54:58,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 18:54:58,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 18:54:58,776 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 18:54:58,777 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 18:54:58,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 18:54:58,777 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 18:54:58,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 18:54:58,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 18:54:58,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 18:54:58,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 18:54:58,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 18:54:58,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 18:54:58,780 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 18:54:58,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 18:54:58,780 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 18:54:58,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 18:54:58,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 18:54:58,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 18:54:58,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 18:54:58,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 18:54:58,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 18:54:58,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 18:54:58,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 18:54:58,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 18:54:58,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 18:54:58,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 18:54:58,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 18:54:58,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 18:54:58,783 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=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true; [2020-08-21 18:54:59,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 18:54:59,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 18:54:59,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 18:54:59,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 18:54:59,082 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 18:54:59,083 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-21 18:54:59,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/84c5e9777/fd42d187711c457c9569071fd022e4b9/FLAG3c85faa39 [2020-08-21 18:54:59,578 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 18:54:59,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-21 18:54:59,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/84c5e9777/fd42d187711c457c9569071fd022e4b9/FLAG3c85faa39 [2020-08-21 18:55:00,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/84c5e9777/fd42d187711c457c9569071fd022e4b9 [2020-08-21 18:55:00,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 18:55:00,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 18:55:00,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 18:55:00,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 18:55:00,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 18:55:00,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa43bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00, skipping insertion in model container [2020-08-21 18:55:00,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 18:55:00,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 18:55:00,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 18:55:00,232 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 18:55:00,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 18:55:00,262 INFO L208 MainTranslator]: Completed translation [2020-08-21 18:55:00,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00 WrapperNode [2020-08-21 18:55:00,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 18:55:00,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 18:55:00,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 18:55:00,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 18:55:00,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (1/1) ... [2020-08-21 18:55:00,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 18:55:00,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 18:55:00,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 18:55:00,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 18:55:00,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (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-21 18:55:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 18:55:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 18:55:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-21 18:55:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 18:55:00,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 18:55:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 18:55:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-21 18:55:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 18:55:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 18:55:00,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 18:55:00,632 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 18:55:00,632 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 18:55:00,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 06:55:00 BoogieIcfgContainer [2020-08-21 18:55:00,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 18:55:00,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 18:55:00,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 18:55:00,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 18:55:00,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 06:55:00" (1/3) ... [2020-08-21 18:55:00,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365457af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 06:55:00, skipping insertion in model container [2020-08-21 18:55:00,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:55:00" (2/3) ... [2020-08-21 18:55:00,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365457af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 06:55:00, skipping insertion in model container [2020-08-21 18:55:00,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 06:55:00" (3/3) ... [2020-08-21 18:55:00,644 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-21 18:55:00,652 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 18:55:00,659 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 18:55:00,671 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 18:55:00,698 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 18:55:00,698 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 18:55:00,699 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 18:55:00,699 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 18:55:00,699 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 18:55:00,699 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 18:55:00,699 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 18:55:00,700 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 18:55:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-21 18:55:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 18:55:00,728 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:00,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:55:00,729 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-21 18:55:00,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:00,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568278766] [2020-08-21 18:55:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:00,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:00,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:00,962 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-21 18:55:00,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568278766] [2020-08-21 18:55:00,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 18:55:00,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 18:55:00,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302219756] [2020-08-21 18:55:00,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 18:55:00,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 18:55:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 18:55:00,993 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-21 18:55:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:01,102 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 18:55:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 18:55:01,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 18:55:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:01,119 INFO L225 Difference]: With dead ends: 35 [2020-08-21 18:55:01,119 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 18:55:01,124 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-21 18:55:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 18:55:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 18:55:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 18:55:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 18:55:01,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 18:55:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:01,179 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 18:55:01,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 18:55:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 18:55:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 18:55:01,181 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:01,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:55:01,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 18:55:01,182 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-21 18:55:01,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:01,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491958396] [2020-08-21 18:55:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,244 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-21 18:55:01,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491958396] [2020-08-21 18:55:01,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 18:55:01,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 18:55:01,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343700427] [2020-08-21 18:55:01,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 18:55:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 18:55:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 18:55:01,248 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 18:55:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:01,333 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 18:55:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 18:55:01,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 18:55:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:01,335 INFO L225 Difference]: With dead ends: 27 [2020-08-21 18:55:01,336 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 18:55:01,337 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-21 18:55:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 18:55:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 18:55:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 18:55:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 18:55:01,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 18:55:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:01,346 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 18:55:01,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 18:55:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 18:55:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 18:55:01,348 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:01,348 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-21 18:55:01,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 18:55:01,349 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-21 18:55:01,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:01,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [292777507] [2020-08-21 18:55:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 18:55:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,499 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-21 18:55:01,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [292777507] [2020-08-21 18:55:01,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:01,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 18:55:01,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203373448] [2020-08-21 18:55:01,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 18:55:01,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 18:55:01,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 18:55:01,502 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-21 18:55:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:01,603 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 18:55:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 18:55:01,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-21 18:55:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:01,605 INFO L225 Difference]: With dead ends: 38 [2020-08-21 18:55:01,605 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 18:55:01,606 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-21 18:55:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 18:55:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 18:55:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 18:55:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 18:55:01,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 18:55:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:01,626 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 18:55:01,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 18:55:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 18:55:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 18:55:01,628 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:01,628 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-21 18:55:01,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 18:55:01,629 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-21 18:55:01,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:01,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1092225811] [2020-08-21 18:55:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,745 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-21 18:55:01,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1092225811] [2020-08-21 18:55:01,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:01,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 18:55:01,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055926702] [2020-08-21 18:55:01,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 18:55:01,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 18:55:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 18:55:01,749 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 18:55:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:01,871 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 18:55:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 18:55:01,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 18:55:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:01,875 INFO L225 Difference]: With dead ends: 41 [2020-08-21 18:55:01,875 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 18:55:01,876 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-21 18:55:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 18:55:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 18:55:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 18:55:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 18:55:01,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 18:55:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:01,889 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 18:55:01,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 18:55:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 18:55:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 18:55:01,891 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:01,892 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-21 18:55:01,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 18:55:01,892 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-21 18:55:01,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:01,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728315538] [2020-08-21 18:55:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:01,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,123 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-21 18:55:02,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728315538] [2020-08-21 18:55:02,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:02,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 18:55:02,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525693072] [2020-08-21 18:55:02,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 18:55:02,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 18:55:02,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-21 18:55:02,128 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-21 18:55:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:02,308 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-21 18:55:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 18:55:02,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-21 18:55:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:02,315 INFO L225 Difference]: With dead ends: 79 [2020-08-21 18:55:02,319 INFO L226 Difference]: Without dead ends: 48 [2020-08-21 18:55:02,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-21 18:55:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-21 18:55:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-21 18:55:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-21 18:55:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-21 18:55:02,345 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-21 18:55:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:02,345 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-21 18:55:02,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 18:55:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-21 18:55:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 18:55:02,352 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:02,352 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-21 18:55:02,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 18:55:02,355 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-21 18:55:02,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:02,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92908133] [2020-08-21 18:55:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,553 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-21 18:55:02,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92908133] [2020-08-21 18:55:02,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:02,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 18:55:02,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379973480] [2020-08-21 18:55:02,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 18:55:02,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:02,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 18:55:02,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 18:55:02,560 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-21 18:55:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:02,694 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-21 18:55:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 18:55:02,695 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 18:55:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:02,697 INFO L225 Difference]: With dead ends: 65 [2020-08-21 18:55:02,698 INFO L226 Difference]: Without dead ends: 61 [2020-08-21 18:55:02,698 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-21 18:55:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-21 18:55:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-21 18:55:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-21 18:55:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-21 18:55:02,713 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-21 18:55:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:02,714 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-21 18:55:02,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 18:55:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-21 18:55:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-21 18:55:02,718 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:02,718 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-21 18:55:02,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 18:55:02,719 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-21 18:55:02,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:02,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869070098] [2020-08-21 18:55:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:02,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,042 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-21 18:55:03,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869070098] [2020-08-21 18:55:03,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:03,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 18:55:03,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741433473] [2020-08-21 18:55:03,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 18:55:03,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 18:55:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-21 18:55:03,045 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-21 18:55:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:03,363 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-21 18:55:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 18:55:03,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-21 18:55:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:03,367 INFO L225 Difference]: With dead ends: 107 [2020-08-21 18:55:03,367 INFO L226 Difference]: Without dead ends: 57 [2020-08-21 18:55:03,369 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-21 18:55:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-21 18:55:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-21 18:55:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-21 18:55:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-21 18:55:03,385 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-21 18:55:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:03,385 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-21 18:55:03,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 18:55:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-21 18:55:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-21 18:55:03,391 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:03,392 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-21 18:55:03,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 18:55:03,392 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-21 18:55:03,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:03,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065122868] [2020-08-21 18:55:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:03,724 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-21 18:55:03,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065122868] [2020-08-21 18:55:03,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:03,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 18:55:03,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032280424] [2020-08-21 18:55:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 18:55:03,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 18:55:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-21 18:55:03,726 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-21 18:55:04,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:04,191 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-21 18:55:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-21 18:55:04,192 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-21 18:55:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:04,194 INFO L225 Difference]: With dead ends: 115 [2020-08-21 18:55:04,194 INFO L226 Difference]: Without dead ends: 74 [2020-08-21 18:55:04,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-21 18:55:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-21 18:55:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-21 18:55:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-21 18:55:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-21 18:55:04,206 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-21 18:55:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:04,207 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-21 18:55:04,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 18:55:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-21 18:55:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 18:55:04,210 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:04,210 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-21 18:55:04,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 18:55:04,210 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-21 18:55:04,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:04,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339136722] [2020-08-21 18:55:04,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:04,614 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-21 18:55:04,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339136722] [2020-08-21 18:55:04,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:04,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 18:55:04,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761401045] [2020-08-21 18:55:04,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 18:55:04,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 18:55:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 18:55:04,617 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-21 18:55:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:04,863 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-21 18:55:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 18:55:04,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 18:55:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:04,871 INFO L225 Difference]: With dead ends: 186 [2020-08-21 18:55:04,873 INFO L226 Difference]: Without dead ends: 182 [2020-08-21 18:55:04,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-21 18:55:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-21 18:55:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-21 18:55:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-21 18:55:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-21 18:55:04,901 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-21 18:55:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:04,902 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-21 18:55:04,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 18:55:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-21 18:55:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-21 18:55:04,908 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:04,908 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-21 18:55:04,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 18:55:04,909 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-21 18:55:04,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:04,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1340066654] [2020-08-21 18:55:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:55:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:05,853 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-21 18:55:05,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1340066654] [2020-08-21 18:55:05,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:05,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-21 18:55:05,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281809001] [2020-08-21 18:55:05,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-21 18:55:05,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:05,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-21 18:55:05,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-21 18:55:05,857 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-21 18:55:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:06,628 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-21 18:55:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-21 18:55:06,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-21 18:55:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:06,632 INFO L225 Difference]: With dead ends: 281 [2020-08-21 18:55:06,632 INFO L226 Difference]: Without dead ends: 125 [2020-08-21 18:55:06,634 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-21 18:55:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-21 18:55:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-21 18:55:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-21 18:55:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-21 18:55:06,648 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-21 18:55:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:06,648 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-21 18:55:06,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-21 18:55:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-21 18:55:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-21 18:55:06,661 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:06,662 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-21 18:55:06,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 18:55:06,663 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-21 18:55:06,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:06,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989243775] [2020-08-21 18:55:06,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:06,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:06,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:55:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 18:55:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:07,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:55:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-21 18:55:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:08,684 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-21 18:55:08,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989243775] [2020-08-21 18:55:08,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:08,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-21 18:55:08,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038256391] [2020-08-21 18:55:08,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-21 18:55:08,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-21 18:55:08,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-21 18:55:08,687 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-21 18:55:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:09,669 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-21 18:55:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-21 18:55:09,670 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-21 18:55:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:09,673 INFO L225 Difference]: With dead ends: 226 [2020-08-21 18:55:09,673 INFO L226 Difference]: Without dead ends: 136 [2020-08-21 18:55:09,676 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-21 18:55:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-21 18:55:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-21 18:55:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-21 18:55:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-21 18:55:09,688 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-21 18:55:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:09,689 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-21 18:55:09,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-21 18:55:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-21 18:55:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-21 18:55:09,711 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:09,711 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-21 18:55:09,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 18:55:09,712 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-21 18:55:09,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:09,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [253706748] [2020-08-21 18:55:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:55:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:55:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:10,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:55:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 18:55:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-21 18:55:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:11,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:55:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:55:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:55:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:55:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:55:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:55:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:55:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:55:12,781 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-21 18:55:12,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [253706748] [2020-08-21 18:55:12,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:55:12,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-21 18:55:12,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698042716] [2020-08-21 18:55:12,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-21 18:55:12,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:55:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-21 18:55:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-21 18:55:12,784 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-21 18:55:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:55:13,164 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-21 18:55:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-21 18:55:13,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-21 18:55:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:55:13,178 INFO L225 Difference]: With dead ends: 486 [2020-08-21 18:55:13,178 INFO L226 Difference]: Without dead ends: 482 [2020-08-21 18:55:13,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-21 18:55:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-21 18:55:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-21 18:55:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-21 18:55:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-21 18:55:13,241 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-21 18:55:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:55:13,243 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-21 18:55:13,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-21 18:55:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-21 18:55:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-21 18:55:13,261 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:55:13,262 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-21 18:55:13,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 18:55:13,262 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:55:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:55:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-21 18:55:13,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:55:13,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845392320] [2020-08-21 18:55:13,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:55:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 18:55:13,976 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 18:55:13,976 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 18:55:13,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 18:55:14,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 06:55:14 BoogieIcfgContainer [2020-08-21 18:55:14,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 18:55:14,120 INFO L168 Benchmark]: Toolchain (without parser) took 14101.96 ms. Allocated memory was 141.6 MB in the beginning and 802.7 MB in the end (delta: 661.1 MB). Free memory was 104.5 MB in the beginning and 295.3 MB in the end (delta: -190.8 MB). Peak memory consumption was 675.4 MB. Max. memory is 7.1 GB. [2020-08-21 18:55:14,121 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 18:55:14,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.93 ms. Allocated memory is still 141.6 MB. Free memory was 104.2 MB in the beginning and 94.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-21 18:55:14,122 INFO L168 Benchmark]: Boogie Preprocessor took 29.23 ms. Allocated memory is still 141.6 MB. Free memory was 94.9 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-21 18:55:14,123 INFO L168 Benchmark]: RCFGBuilder took 344.01 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 93.5 MB in the beginning and 172.1 MB in the end (delta: -78.6 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-08-21 18:55:14,124 INFO L168 Benchmark]: TraceAbstraction took 13475.49 ms. Allocated memory was 205.0 MB in the beginning and 802.7 MB in the end (delta: 597.7 MB). Free memory was 172.1 MB in the beginning and 295.3 MB in the end (delta: -123.2 MB). Peak memory consumption was 679.6 MB. Max. memory is 7.1 GB. [2020-08-21 18:55:14,127 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.23 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.93 ms. Allocated memory is still 141.6 MB. Free memory was 104.2 MB in the beginning and 94.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.23 ms. Allocated memory is still 141.6 MB. Free memory was 94.9 MB in the beginning and 93.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.01 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 93.5 MB in the beginning and 172.1 MB in the end (delta: -78.6 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13475.49 ms. Allocated memory was 205.0 MB in the beginning and 802.7 MB in the end (delta: 597.7 MB). Free memory was 172.1 MB in the beginning and 295.3 MB in the end (delta: -123.2 MB). Peak memory consumption was 679.6 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.2s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1803 SolverSat, 738 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.4s 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.2s 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...