/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 04:20:54,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 04:20:54,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 04:20:54,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 04:20:54,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 04:20:54,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 04:20:54,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 04:20:54,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 04:20:54,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 04:20:54,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 04:20:54,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 04:20:54,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 04:20:54,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 04:20:54,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 04:20:54,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 04:20:54,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 04:20:54,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 04:20:54,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 04:20:54,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 04:20:54,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 04:20:54,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 04:20:54,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 04:20:54,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 04:20:54,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 04:20:54,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 04:20:54,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 04:20:54,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 04:20:54,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 04:20:54,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 04:20:54,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 04:20:54,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 04:20:54,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 04:20:54,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 04:20:54,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 04:20:54,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 04:20:54,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 04:20:54,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 04:20:54,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 04:20:54,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 04:20:54,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 04:20:54,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 04:20:54,796 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-19 04:20:54,835 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 04:20:54,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 04:20:54,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 04:20:54,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 04:20:54,838 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 04:20:54,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 04:20:54,839 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 04:20:54,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 04:20:54,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 04:20:54,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 04:20:54,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 04:20:54,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 04:20:54,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 04:20:54,841 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 04:20:54,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 04:20:54,841 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 04:20:54,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 04:20:54,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 04:20:54,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 04:20:54,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 04:20:54,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 04:20:54,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 04:20:54,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 04:20:54,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 04:20:54,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 04:20:54,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 04:20:54,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 04:20:54,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 04:20:54,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 04:20:54,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2; [2020-08-19 04:20:55,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 04:20:55,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 04:20:55,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 04:20:55,205 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 04:20:55,205 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 04:20:55,206 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 04:20:55,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1aceafaa9/e1bd38ccb0b14649b37743333a56bc03/FLAG24e9a11a7 [2020-08-19 04:20:55,730 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 04:20:55,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 04:20:55,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1aceafaa9/e1bd38ccb0b14649b37743333a56bc03/FLAG24e9a11a7 [2020-08-19 04:20:56,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1aceafaa9/e1bd38ccb0b14649b37743333a56bc03 [2020-08-19 04:20:56,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 04:20:56,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 04:20:56,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 04:20:56,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 04:20:56,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 04:20:56,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccc0ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56, skipping insertion in model container [2020-08-19 04:20:56,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 04:20:56,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 04:20:56,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 04:20:56,314 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 04:20:56,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 04:20:56,351 INFO L208 MainTranslator]: Completed translation [2020-08-19 04:20:56,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56 WrapperNode [2020-08-19 04:20:56,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 04:20:56,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 04:20:56,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 04:20:56,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 04:20:56,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (1/1) ... [2020-08-19 04:20:56,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 04:20:56,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 04:20:56,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 04:20:56,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 04:20:56,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (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-19 04:20:56,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 04:20:56,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 04:20:56,537 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 04:20:56,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 04:20:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 04:20:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 04:20:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 04:20:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 04:20:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 04:20:56,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 04:20:56,722 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 04:20:56,722 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 04:20:56,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 04:20:56 BoogieIcfgContainer [2020-08-19 04:20:56,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 04:20:56,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 04:20:56,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 04:20:56,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 04:20:56,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 04:20:56" (1/3) ... [2020-08-19 04:20:56,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e32b920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 04:20:56, skipping insertion in model container [2020-08-19 04:20:56,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 04:20:56" (2/3) ... [2020-08-19 04:20:56,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e32b920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 04:20:56, skipping insertion in model container [2020-08-19 04:20:56,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 04:20:56" (3/3) ... [2020-08-19 04:20:56,736 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 04:20:56,748 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 04:20:56,756 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 04:20:56,773 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 04:20:56,803 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 04:20:56,804 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 04:20:56,804 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 04:20:56,804 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 04:20:56,805 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 04:20:56,805 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 04:20:56,805 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 04:20:56,805 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 04:20:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 04:20:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 04:20:56,844 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:56,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:20:56,846 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 04:20:56,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:56,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [890998195] [2020-08-19 04:20:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,098 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-19 04:20:57,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [890998195] [2020-08-19 04:20:57,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 04:20:57,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 04:20:57,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217774883] [2020-08-19 04:20:57,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 04:20:57,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:57,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 04:20:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 04:20:57,121 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 04:20:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:57,247 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 04:20:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 04:20:57,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 04:20:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:57,260 INFO L225 Difference]: With dead ends: 35 [2020-08-19 04:20:57,261 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 04:20:57,264 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-19 04:20:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 04:20:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 04:20:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 04:20:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 04:20:57,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 04:20:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:57,310 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 04:20:57,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 04:20:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 04:20:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 04:20:57,312 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:57,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:20:57,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 04:20:57,314 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 04:20:57,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:57,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128439775] [2020-08-19 04:20:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,387 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-19 04:20:57,388 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128439775] [2020-08-19 04:20:57,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 04:20:57,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 04:20:57,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110397745] [2020-08-19 04:20:57,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 04:20:57,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:57,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 04:20:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 04:20:57,392 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 04:20:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:57,463 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 04:20:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 04:20:57,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 04:20:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:57,466 INFO L225 Difference]: With dead ends: 27 [2020-08-19 04:20:57,466 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 04:20:57,467 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-19 04:20:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 04:20:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 04:20:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 04:20:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 04:20:57,476 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 04:20:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:57,476 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 04:20:57,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 04:20:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 04:20:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 04:20:57,478 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:57,478 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-19 04:20:57,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 04:20:57,479 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 04:20:57,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:57,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526625034] [2020-08-19 04:20:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 04:20:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,629 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-19 04:20:57,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526625034] [2020-08-19 04:20:57,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:20:57,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 04:20:57,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107888367] [2020-08-19 04:20:57,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 04:20:57,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 04:20:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 04:20:57,632 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 04:20:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:57,728 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 04:20:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 04:20:57,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 04:20:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:57,730 INFO L225 Difference]: With dead ends: 38 [2020-08-19 04:20:57,730 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 04:20:57,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-19 04:20:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 04:20:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 04:20:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 04:20:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 04:20:57,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 04:20:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:57,741 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 04:20:57,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 04:20:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 04:20:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 04:20:57,743 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:57,743 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-19 04:20:57,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 04:20:57,744 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 04:20:57,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:57,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749988543] [2020-08-19 04:20:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:57,853 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-19 04:20:57,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [749988543] [2020-08-19 04:20:57,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:20:57,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 04:20:57,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849318640] [2020-08-19 04:20:57,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 04:20:57,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 04:20:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 04:20:57,859 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 04:20:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:57,990 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 04:20:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 04:20:57,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 04:20:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:57,994 INFO L225 Difference]: With dead ends: 41 [2020-08-19 04:20:57,994 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 04:20:57,995 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-19 04:20:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 04:20:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 04:20:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 04:20:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 04:20:58,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 04:20:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:58,008 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 04:20:58,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 04:20:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 04:20:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 04:20:58,011 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:58,012 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-19 04:20:58,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 04:20:58,012 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 04:20:58,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:58,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160203206] [2020-08-19 04:20:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:20:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,202 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-19 04:20:58,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160203206] [2020-08-19 04:20:58,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:20:58,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 04:20:58,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31288710] [2020-08-19 04:20:58,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 04:20:58,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:58,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 04:20:58,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 04:20:58,206 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 04:20:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:58,366 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 04:20:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 04:20:58,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 04:20:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:58,373 INFO L225 Difference]: With dead ends: 76 [2020-08-19 04:20:58,373 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 04:20:58,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-19 04:20:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 04:20:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 04:20:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 04:20:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 04:20:58,400 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 04:20:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:58,403 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 04:20:58,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 04:20:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 04:20:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 04:20:58,405 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:58,406 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-19 04:20:58,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 04:20:58,406 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 04:20:58,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:58,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [378718040] [2020-08-19 04:20:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:20:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,519 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-19 04:20:58,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [378718040] [2020-08-19 04:20:58,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:20:58,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 04:20:58,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56948481] [2020-08-19 04:20:58,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 04:20:58,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 04:20:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 04:20:58,522 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 04:20:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:58,637 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 04:20:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 04:20:58,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 04:20:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:58,640 INFO L225 Difference]: With dead ends: 62 [2020-08-19 04:20:58,640 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 04:20:58,641 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-19 04:20:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 04:20:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 04:20:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 04:20:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 04:20:58,655 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 04:20:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:58,655 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 04:20:58,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 04:20:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 04:20:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 04:20:58,660 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:58,660 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:20:58,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 04:20:58,660 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 04:20:58,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:58,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091245655] [2020-08-19 04:20:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:20:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:20:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:20:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:20:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-19 04:20:58,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091245655] [2020-08-19 04:20:58,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:20:58,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 04:20:58,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001654446] [2020-08-19 04:20:58,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 04:20:58,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 04:20:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 04:20:58,915 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 04:20:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:20:59,087 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 04:20:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 04:20:59,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 04:20:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:20:59,092 INFO L225 Difference]: With dead ends: 97 [2020-08-19 04:20:59,093 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 04:20:59,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-19 04:20:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 04:20:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 04:20:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 04:20:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 04:20:59,114 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 04:20:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:20:59,115 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 04:20:59,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 04:20:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 04:20:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 04:20:59,120 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:20:59,121 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:20:59,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 04:20:59,121 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:20:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:20:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 04:20:59,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:20:59,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201013203] [2020-08-19 04:20:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:20:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:20:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:20:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:20:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:20:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:20:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:20:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:20:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:20:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:20:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:20:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:20:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-19 04:20:59,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201013203] [2020-08-19 04:20:59,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:20:59,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 04:20:59,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470694039] [2020-08-19 04:20:59,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 04:20:59,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:20:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 04:20:59,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 04:20:59,713 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 04:21:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:21:00,104 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 04:21:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 04:21:00,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 04:21:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:21:00,106 INFO L225 Difference]: With dead ends: 153 [2020-08-19 04:21:00,107 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 04:21:00,110 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-19 04:21:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 04:21:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 04:21:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 04:21:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 04:21:00,119 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 04:21:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:21:00,119 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 04:21:00,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 04:21:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 04:21:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 04:21:00,121 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:21:00,121 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:21:00,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 04:21:00,122 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:21:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:21:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 04:21:00,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:21:00,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195482348] [2020-08-19 04:21:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:21:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:21:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:21:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-19 04:21:00,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195482348] [2020-08-19 04:21:00,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:21:00,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 04:21:00,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062230137] [2020-08-19 04:21:00,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 04:21:00,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:21:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 04:21:00,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 04:21:00,358 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 04:21:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:21:00,534 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 04:21:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 04:21:00,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 04:21:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:21:00,536 INFO L225 Difference]: With dead ends: 68 [2020-08-19 04:21:00,537 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 04:21:00,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 04:21:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 04:21:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 04:21:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 04:21:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 04:21:00,546 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 04:21:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:21:00,547 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 04:21:00,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 04:21:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 04:21:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 04:21:00,549 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:21:00,549 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-19 04:21:00,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 04:21:00,549 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:21:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:21:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 04:21:00,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:21:00,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1272148492] [2020-08-19 04:21:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:21:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:21:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:21:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 04:21:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:00,935 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-19 04:21:00,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1272148492] [2020-08-19 04:21:00,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:21:00,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 04:21:00,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452247585] [2020-08-19 04:21:00,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 04:21:00,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:21:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 04:21:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 04:21:00,938 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 04:21:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:21:01,149 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 04:21:01,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 04:21:01,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 04:21:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:21:01,153 INFO L225 Difference]: With dead ends: 180 [2020-08-19 04:21:01,153 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 04:21:01,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 04:21:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 04:21:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 04:21:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 04:21:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 04:21:01,174 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 04:21:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:21:01,174 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 04:21:01,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 04:21:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 04:21:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 04:21:01,179 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:21:01,180 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:21:01,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 04:21:01,180 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:21:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:21:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 04:21:01,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:21:01,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181810898] [2020-08-19 04:21:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:21:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:21:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:21:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 04:21:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 04:21:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-19 04:21:01,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181810898] [2020-08-19 04:21:01,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:21:01,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 04:21:01,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47314951] [2020-08-19 04:21:01,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 04:21:01,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:21:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 04:21:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 04:21:01,930 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 04:21:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:21:02,264 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 04:21:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 04:21:02,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 04:21:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:21:02,270 INFO L225 Difference]: With dead ends: 410 [2020-08-19 04:21:02,271 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 04:21:02,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-19 04:21:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 04:21:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 04:21:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 04:21:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 04:21:02,312 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 04:21:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:21:02,314 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 04:21:02,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 04:21:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 04:21:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-19 04:21:02,329 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:21:02,330 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:21:02,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 04:21:02,330 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:21:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:21:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-19 04:21:02,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:21:02,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1581175773] [2020-08-19 04:21:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:21:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:02,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 04:21:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:02,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 04:21:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:02,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:02,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 04:21:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 04:21:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 04:21:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 04:21:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 04:21:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 04:21:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 04:21:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 04:21:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 04:21:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:03,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 04:21:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 04:21:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-19 04:21:04,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1581175773] [2020-08-19 04:21:04,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 04:21:04,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 04:21:04,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86961205] [2020-08-19 04:21:04,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 04:21:04,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 04:21:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 04:21:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-19 04:21:04,264 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-19 04:21:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 04:21:05,147 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-19 04:21:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-19 04:21:05,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-19 04:21:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 04:21:05,152 INFO L225 Difference]: With dead ends: 531 [2020-08-19 04:21:05,153 INFO L226 Difference]: Without dead ends: 148 [2020-08-19 04:21:05,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-19 04:21:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-19 04:21:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-19 04:21:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-19 04:21:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-19 04:21:05,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-19 04:21:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 04:21:05,172 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-19 04:21:05,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 04:21:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-19 04:21:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 04:21:05,181 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 04:21:05,181 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 04:21:05,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 04:21:05,182 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 04:21:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 04:21:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-19 04:21:05,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 04:21:05,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1715022105] [2020-08-19 04:21:05,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 04:21:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 04:21:05,280 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 04:21:05,281 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 04:21:05,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 04:21:05,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 04:21:05 BoogieIcfgContainer [2020-08-19 04:21:05,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 04:21:05,372 INFO L168 Benchmark]: Toolchain (without parser) took 9270.07 ms. Allocated memory was 142.6 MB in the beginning and 491.8 MB in the end (delta: 349.2 MB). Free memory was 102.4 MB in the beginning and 176.6 MB in the end (delta: -74.2 MB). Peak memory consumption was 275.0 MB. Max. memory is 7.1 GB. [2020-08-19 04:21:05,373 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 04:21:05,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.04 ms. Allocated memory is still 142.6 MB. Free memory was 102.2 MB in the beginning and 92.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-08-19 04:21:05,374 INFO L168 Benchmark]: Boogie Preprocessor took 23.01 ms. Allocated memory is still 142.6 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-19 04:21:05,375 INFO L168 Benchmark]: RCFGBuilder took 349.96 ms. Allocated memory was 142.6 MB in the beginning and 202.9 MB in the end (delta: 60.3 MB). Free memory was 91.5 MB in the beginning and 170.5 MB in the end (delta: -79.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-08-19 04:21:05,376 INFO L168 Benchmark]: TraceAbstraction took 8641.24 ms. Allocated memory was 202.9 MB in the beginning and 491.8 MB in the end (delta: 288.9 MB). Free memory was 169.8 MB in the beginning and 176.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 282.1 MB. Max. memory is 7.1 GB. [2020-08-19 04:21:05,379 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.21 ms. Allocated memory is still 142.6 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.04 ms. Allocated memory is still 142.6 MB. Free memory was 102.2 MB in the beginning and 92.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.01 ms. Allocated memory is still 142.6 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.96 ms. Allocated memory was 142.6 MB in the beginning and 202.9 MB in the end (delta: 60.3 MB). Free memory was 91.5 MB in the beginning and 170.5 MB in the end (delta: -79.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8641.24 ms. Allocated memory was 202.9 MB in the beginning and 491.8 MB in the end (delta: 288.9 MB). Free memory was 169.8 MB in the beginning and 176.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 282.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1355 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, 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, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 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...