/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDEST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 22:08:25,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 22:08:25,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 22:08:25,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 22:08:25,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 22:08:25,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 22:08:25,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 22:08:25,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 22:08:25,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 22:08:25,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 22:08:25,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 22:08:25,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 22:08:25,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 22:08:25,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 22:08:25,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 22:08:25,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 22:08:25,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 22:08:25,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 22:08:25,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 22:08:25,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 22:08:25,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 22:08:25,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 22:08:25,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 22:08:25,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 22:08:25,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 22:08:25,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 22:08:25,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 22:08:25,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 22:08:25,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 22:08:25,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 22:08:25,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 22:08:25,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 22:08:25,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 22:08:25,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 22:08:25,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 22:08:25,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 22:08:25,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 22:08:25,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 22:08:25,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 22:08:25,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 22:08:25,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 22:08:25,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 22:08:25,911 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 22:08:25,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 22:08:25,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 22:08:25,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 22:08:25,914 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 22:08:25,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 22:08:25,914 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 22:08:25,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 22:08:25,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 22:08:25,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 22:08:25,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 22:08:25,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 22:08:25,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 22:08:25,917 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 22:08:25,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 22:08:25,917 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 22:08:25,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 22:08:25,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 22:08:25,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 22:08:25,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 22:08:25,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 22:08:25,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 22:08:25,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 22:08:25,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 22:08:25,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 22:08:25,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 22:08:25,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 22:08:25,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 22:08:25,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 22:08:25,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDEST;log-additional-information=true; [2020-08-21 22:08:26,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 22:08:26,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 22:08:26,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 22:08:26,264 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 22:08:26,264 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 22:08:26,265 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-21 22:08:26,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/39a79d295/933ba8760da7482387b31f900865eed7/FLAG5e31bd08e [2020-08-21 22:08:26,747 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 22:08:26,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 22:08:26,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/39a79d295/933ba8760da7482387b31f900865eed7/FLAG5e31bd08e [2020-08-21 22:08:27,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/39a79d295/933ba8760da7482387b31f900865eed7 [2020-08-21 22:08:27,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 22:08:27,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 22:08:27,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 22:08:27,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 22:08:27,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 22:08:27,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe964b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27, skipping insertion in model container [2020-08-21 22:08:27,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 22:08:27,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 22:08:27,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 22:08:27,468 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 22:08:27,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 22:08:27,496 INFO L208 MainTranslator]: Completed translation [2020-08-21 22:08:27,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27 WrapperNode [2020-08-21 22:08:27,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 22:08:27,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 22:08:27,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 22:08:27,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 22:08:27,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... [2020-08-21 22:08:27,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 22:08:27,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 22:08:27,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 22:08:27,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 22:08:27,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 22:08:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 22:08:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 22:08:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 22:08:27,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 22:08:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 22:08:27,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 22:08:27,666 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 22:08:27,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 22:08:27,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 22:08:27,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 22:08:27,886 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 22:08:27,886 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 22:08:27,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 10:08:27 BoogieIcfgContainer [2020-08-21 22:08:27,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 22:08:27,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 22:08:27,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 22:08:27,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 22:08:27,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 10:08:27" (1/3) ... [2020-08-21 22:08:27,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cf772b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 10:08:27, skipping insertion in model container [2020-08-21 22:08:27,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 10:08:27" (2/3) ... [2020-08-21 22:08:27,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cf772b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 10:08:27, skipping insertion in model container [2020-08-21 22:08:27,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 10:08:27" (3/3) ... [2020-08-21 22:08:27,924 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 22:08:27,949 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 22:08:27,960 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 22:08:27,977 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 22:08:28,001 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 22:08:28,002 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 22:08:28,002 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 22:08:28,002 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 22:08:28,002 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 22:08:28,002 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 22:08:28,003 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 22:08:28,003 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 22:08:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 22:08:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 22:08:28,031 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:28,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:08:28,033 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 22:08:28,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:28,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822452149] [2020-08-21 22:08:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 22:08:28,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822452149] [2020-08-21 22:08:28,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 22:08:28,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 22:08:28,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608592228] [2020-08-21 22:08:28,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 22:08:28,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 22:08:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 22:08:28,281 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 22:08:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:28,402 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 22:08:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 22:08:28,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 22:08:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:28,416 INFO L225 Difference]: With dead ends: 35 [2020-08-21 22:08:28,417 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 22:08:28,421 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 22:08:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 22:08:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 22:08:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 22:08:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 22:08:28,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 22:08:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:28,470 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 22:08:28,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 22:08:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 22:08:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 22:08:28,472 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:28,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:08:28,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 22:08:28,473 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:28,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 22:08:28,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:28,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959243662] [2020-08-21 22:08:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 22:08:28,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959243662] [2020-08-21 22:08:28,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 22:08:28,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 22:08:28,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811000671] [2020-08-21 22:08:28,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 22:08:28,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 22:08:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 22:08:28,540 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 22:08:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:28,613 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 22:08:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 22:08:28,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 22:08:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:28,616 INFO L225 Difference]: With dead ends: 27 [2020-08-21 22:08:28,616 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 22:08:28,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 22:08:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 22:08:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 22:08:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 22:08:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 22:08:28,625 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 22:08:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:28,625 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 22:08:28,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 22:08:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 22:08:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 22:08:28,627 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:28,627 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:08:28,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 22:08:28,628 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 22:08:28,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:28,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1860977990] [2020-08-21 22:08:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 22:08:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-21 22:08:28,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1860977990] [2020-08-21 22:08:28,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:28,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 22:08:28,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810126610] [2020-08-21 22:08:28,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 22:08:28,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 22:08:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 22:08:28,741 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 22:08:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:28,825 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 22:08:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 22:08:28,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 22:08:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:28,827 INFO L225 Difference]: With dead ends: 38 [2020-08-21 22:08:28,828 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 22:08:28,829 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-21 22:08:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 22:08:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 22:08:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 22:08:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 22:08:28,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 22:08:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:28,837 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 22:08:28,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 22:08:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 22:08:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 22:08:28,839 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:28,839 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:08:28,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 22:08:28,840 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 22:08:28,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:28,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1258176155] [2020-08-21 22:08:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-21 22:08:28,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1258176155] [2020-08-21 22:08:28,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:28,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 22:08:28,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079841503] [2020-08-21 22:08:28,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 22:08:28,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 22:08:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 22:08:28,960 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 22:08:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:29,077 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 22:08:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 22:08:29,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 22:08:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:29,080 INFO L225 Difference]: With dead ends: 41 [2020-08-21 22:08:29,080 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 22:08:29,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-21 22:08:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 22:08:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 22:08:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 22:08:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 22:08:29,092 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 22:08:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:29,093 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 22:08:29,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 22:08:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 22:08:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 22:08:29,095 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:29,095 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:08:29,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 22:08:29,096 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 22:08:29,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:29,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [874115648] [2020-08-21 22:08:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-21 22:08:29,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [874115648] [2020-08-21 22:08:29,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:29,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 22:08:29,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169908817] [2020-08-21 22:08:29,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 22:08:29,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:29,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 22:08:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 22:08:29,249 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 22:08:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:29,367 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 22:08:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 22:08:29,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 22:08:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:29,370 INFO L225 Difference]: With dead ends: 76 [2020-08-21 22:08:29,370 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 22:08:29,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-21 22:08:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 22:08:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 22:08:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 22:08:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 22:08:29,384 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 22:08:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:29,385 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 22:08:29,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 22:08:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 22:08:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 22:08:29,387 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:29,388 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 22:08:29,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 22:08:29,388 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 22:08:29,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:29,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275106828] [2020-08-21 22:08:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-21 22:08:29,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275106828] [2020-08-21 22:08:29,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:29,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 22:08:29,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582319607] [2020-08-21 22:08:29,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 22:08:29,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 22:08:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 22:08:29,559 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 22:08:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:29,696 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 22:08:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 22:08:29,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 22:08:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:29,699 INFO L225 Difference]: With dead ends: 62 [2020-08-21 22:08:29,699 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 22:08:29,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 22:08:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 22:08:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 22:08:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 22:08:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 22:08:29,714 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 22:08:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:29,715 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 22:08:29,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 22:08:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 22:08:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 22:08:29,719 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:29,719 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-21 22:08:29,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 22:08:29,720 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 22:08:29,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:29,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128987400] [2020-08-21 22:08:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:29,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,084 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-21 22:08:30,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128987400] [2020-08-21 22:08:30,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:30,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 22:08:30,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117696304] [2020-08-21 22:08:30,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 22:08:30,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 22:08:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 22:08:30,087 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 22:08:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:30,234 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 22:08:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 22:08:30,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 22:08:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:30,238 INFO L225 Difference]: With dead ends: 97 [2020-08-21 22:08:30,238 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 22:08:30,240 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-21 22:08:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 22:08:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 22:08:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 22:08:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 22:08:30,260 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 22:08:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:30,260 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 22:08:30,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 22:08:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 22:08:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 22:08:30,267 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:30,268 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-21 22:08:30,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 22:08:30,268 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 22:08:30,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:30,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2137758785] [2020-08-21 22:08:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:08:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:08:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:30,706 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-21 22:08:30,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2137758785] [2020-08-21 22:08:30,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:30,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 22:08:30,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377884422] [2020-08-21 22:08:30,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 22:08:30,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 22:08:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 22:08:30,709 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 22:08:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:31,118 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 22:08:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 22:08:31,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 22:08:31,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:31,120 INFO L225 Difference]: With dead ends: 153 [2020-08-21 22:08:31,120 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 22:08:31,123 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-21 22:08:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 22:08:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 22:08:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 22:08:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 22:08:31,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 22:08:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:31,134 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 22:08:31,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 22:08:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 22:08:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 22:08:31,136 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:31,136 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-21 22:08:31,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 22:08:31,137 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:31,137 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 22:08:31,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:31,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349865030] [2020-08-21 22:08:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:08:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,364 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-21 22:08:31,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349865030] [2020-08-21 22:08:31,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:31,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 22:08:31,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803970202] [2020-08-21 22:08:31,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 22:08:31,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 22:08:31,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 22:08:31,367 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 22:08:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:31,535 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 22:08:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 22:08:31,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 22:08:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:31,537 INFO L225 Difference]: With dead ends: 68 [2020-08-21 22:08:31,537 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 22:08:31,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 22:08:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 22:08:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 22:08:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 22:08:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 22:08:31,546 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 22:08:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:31,547 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 22:08:31,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 22:08:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 22:08:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 22:08:31,549 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:31,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-21 22:08:31,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 22:08:31,550 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 22:08:31,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:31,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995044684] [2020-08-21 22:08:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:08:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 22:08:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-21 22:08:31,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995044684] [2020-08-21 22:08:31,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:31,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 22:08:31,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339290293] [2020-08-21 22:08:31,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 22:08:31,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 22:08:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 22:08:31,928 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 22:08:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:32,127 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 22:08:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 22:08:32,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 22:08:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:32,130 INFO L225 Difference]: With dead ends: 180 [2020-08-21 22:08:32,130 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 22:08:32,131 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-21 22:08:32,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 22:08:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 22:08:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 22:08:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 22:08:32,150 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 22:08:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:32,151 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 22:08:32,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 22:08:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 22:08:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 22:08:32,155 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:32,156 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-21 22:08:32,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 22:08:32,156 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 22:08:32,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:32,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795943000] [2020-08-21 22:08:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 22:08:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 22:08:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:08:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 22:08:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 22:08:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 22:08:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 22:08:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 22:08:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 22:08:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 22:08:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 22:08:32,982 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-21 22:08:32,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795943000] [2020-08-21 22:08:32,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 22:08:32,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 22:08:32,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104468009] [2020-08-21 22:08:32,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 22:08:32,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 22:08:32,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 22:08:32,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 22:08:32,986 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 22:08:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 22:08:33,299 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 22:08:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 22:08:33,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 22:08:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 22:08:33,306 INFO L225 Difference]: With dead ends: 410 [2020-08-21 22:08:33,307 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 22:08:33,308 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-21 22:08:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 22:08:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 22:08:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 22:08:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 22:08:33,346 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 22:08:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 22:08:33,347 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 22:08:33,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 22:08:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 22:08:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 22:08:33,357 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 22:08:33,357 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-21 22:08:33,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 22:08:33,358 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 22:08:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 22:08:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-21 22:08:33,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 22:08:33,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1880080898] [2020-08-21 22:08:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 22:08:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 22:08:33,487 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 22:08:33,487 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 22:08:33,493 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 22:08:33,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 10:08:33 BoogieIcfgContainer [2020-08-21 22:08:33,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 22:08:33,544 INFO L168 Benchmark]: Toolchain (without parser) took 6363.05 ms. Allocated memory was 139.5 MB in the beginning and 372.2 MB in the end (delta: 232.8 MB). Free memory was 102.8 MB in the beginning and 187.9 MB in the end (delta: -85.1 MB). Peak memory consumption was 147.7 MB. Max. memory is 7.1 GB. [2020-08-21 22:08:33,545 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-21 22:08:33,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.51 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 93.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-21 22:08:33,547 INFO L168 Benchmark]: Boogie Preprocessor took 103.79 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.2 MB in the beginning and 181.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-08-21 22:08:33,547 INFO L168 Benchmark]: RCFGBuilder took 295.25 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 169.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-08-21 22:08:33,548 INFO L168 Benchmark]: TraceAbstraction took 5642.40 ms. Allocated memory was 202.4 MB in the beginning and 372.2 MB in the end (delta: 169.9 MB). Free memory was 168.4 MB in the beginning and 187.9 MB in the end (delta: -19.5 MB). Peak memory consumption was 150.4 MB. Max. memory is 7.1 GB. [2020-08-21 22:08:33,552 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.51 ms. Allocated memory is still 139.5 MB. Free memory was 102.4 MB in the beginning and 93.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.79 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.2 MB in the beginning and 181.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.25 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 169.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5642.40 ms. Allocated memory was 202.4 MB in the beginning and 372.2 MB in the end (delta: 169.9 MB). Free memory was 168.4 MB in the beginning and 187.9 MB in the end (delta: -19.5 MB). Peak memory consumption was 150.4 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: 5.4s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 905 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 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...