/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.3 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 05:09:24,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 05:09:24,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 05:09:24,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 05:09:24,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 05:09:24,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 05:09:24,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 05:09:24,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 05:09:24,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 05:09:24,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 05:09:24,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 05:09:24,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 05:09:24,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 05:09:24,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 05:09:24,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 05:09:24,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 05:09:24,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 05:09:24,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 05:09:24,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 05:09:24,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 05:09:24,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 05:09:24,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 05:09:24,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 05:09:24,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 05:09:24,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 05:09:24,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 05:09:24,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 05:09:24,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 05:09:24,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 05:09:24,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 05:09:24,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 05:09:25,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 05:09:25,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 05:09:25,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 05:09:25,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 05:09:25,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 05:09:25,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 05:09:25,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 05:09:25,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 05:09:25,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 05:09:25,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 05:09:25,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 05:09:25,052 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 05:09:25,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 05:09:25,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 05:09:25,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 05:09:25,055 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 05:09:25,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 05:09:25,056 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 05:09:25,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 05:09:25,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 05:09:25,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 05:09:25,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 05:09:25,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 05:09:25,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 05:09:25,058 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 05:09:25,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 05:09:25,059 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 05:09:25,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 05:09:25,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 05:09:25,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 05:09:25,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 05:09:25,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 05:09:25,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 05:09:25,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 05:09:25,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 05:09:25,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 05:09:25,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 05:09:25,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 05:09:25,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 05:09:25,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 05:09:25,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.3; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.3; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.3; [2020-08-19 05:09:25,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 05:09:25,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 05:09:25,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 05:09:25,446 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 05:09:25,447 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 05:09:25,448 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 05:09:25,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d92a9e101/b96f33acee7e47d8b833d2ac06189eb6/FLAG78e7cf8c4 [2020-08-19 05:09:25,995 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 05:09:25,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 05:09:26,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d92a9e101/b96f33acee7e47d8b833d2ac06189eb6/FLAG78e7cf8c4 [2020-08-19 05:09:26,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d92a9e101/b96f33acee7e47d8b833d2ac06189eb6 [2020-08-19 05:09:26,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 05:09:26,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 05:09:26,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 05:09:26,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 05:09:26,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 05:09:26,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16768517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26, skipping insertion in model container [2020-08-19 05:09:26,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 05:09:26,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 05:09:26,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 05:09:26,645 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 05:09:26,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 05:09:26,678 INFO L208 MainTranslator]: Completed translation [2020-08-19 05:09:26,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26 WrapperNode [2020-08-19 05:09:26,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 05:09:26,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 05:09:26,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 05:09:26,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 05:09:26,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... [2020-08-19 05:09:26,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 05:09:26,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 05:09:26,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 05:09:26,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 05:09:26,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 05:09:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 05:09:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 05:09:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 05:09:26,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 05:09:26,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 05:09:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 05:09:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 05:09:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 05:09:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 05:09:26,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 05:09:27,035 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 05:09:27,036 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 05:09:27,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 05:09:27 BoogieIcfgContainer [2020-08-19 05:09:27,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 05:09:27,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 05:09:27,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 05:09:27,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 05:09:27,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 05:09:26" (1/3) ... [2020-08-19 05:09:27,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f658239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 05:09:27, skipping insertion in model container [2020-08-19 05:09:27,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 05:09:26" (2/3) ... [2020-08-19 05:09:27,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f658239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 05:09:27, skipping insertion in model container [2020-08-19 05:09:27,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 05:09:27" (3/3) ... [2020-08-19 05:09:27,048 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 05:09:27,059 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 05:09:27,067 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 05:09:27,081 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 05:09:27,105 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 05:09:27,106 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 05:09:27,106 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 05:09:27,106 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 05:09:27,106 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 05:09:27,106 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 05:09:27,107 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 05:09:27,107 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 05:09:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 05:09:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 05:09:27,133 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:27,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:27,134 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:27,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 05:09:27,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:27,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260191257] [2020-08-19 05:09:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 05:09:27,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260191257] [2020-08-19 05:09:27,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 05:09:27,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 05:09:27,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618231048] [2020-08-19 05:09:27,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 05:09:27,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 05:09:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 05:09:27,391 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 05:09:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:27,583 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 05:09:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 05:09:27,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 05:09:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:27,596 INFO L225 Difference]: With dead ends: 35 [2020-08-19 05:09:27,597 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 05:09:27,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 05:09:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 05:09:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 05:09:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 05:09:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 05:09:27,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 05:09:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:27,645 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 05:09:27,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 05:09:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 05:09:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 05:09:27,648 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:27,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:27,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 05:09:27,649 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 05:09:27,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:27,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910996685] [2020-08-19 05:09:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 05:09:27,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910996685] [2020-08-19 05:09:27,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 05:09:27,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 05:09:27,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407567478] [2020-08-19 05:09:27,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 05:09:27,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:27,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 05:09:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 05:09:27,747 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 05:09:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:27,818 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 05:09:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 05:09:27,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 05:09:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:27,821 INFO L225 Difference]: With dead ends: 27 [2020-08-19 05:09:27,821 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 05:09:27,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 05:09:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 05:09:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 05:09:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 05:09:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 05:09:27,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 05:09:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:27,831 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 05:09:27,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 05:09:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 05:09:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 05:09:27,833 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:27,833 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:27,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 05:09:27,834 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 05:09:27,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:27,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966071167] [2020-08-19 05:09:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 05:09:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-19 05:09:27,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966071167] [2020-08-19 05:09:27,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:28,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 05:09:28,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919868336] [2020-08-19 05:09:28,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 05:09:28,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 05:09:28,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 05:09:28,002 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 05:09:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:28,094 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 05:09:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 05:09:28,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 05:09:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:28,097 INFO L225 Difference]: With dead ends: 38 [2020-08-19 05:09:28,097 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 05:09:28,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-19 05:09:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 05:09:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 05:09:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 05:09:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 05:09:28,106 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 05:09:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:28,107 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 05:09:28,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 05:09:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 05:09:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 05:09:28,109 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:28,109 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:28,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 05:09:28,110 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 05:09:28,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:28,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1576471338] [2020-08-19 05:09:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 05:09:28,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1576471338] [2020-08-19 05:09:28,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:28,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 05:09:28,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372837455] [2020-08-19 05:09:28,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 05:09:28,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 05:09:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 05:09:28,213 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 05:09:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:28,339 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 05:09:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 05:09:28,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 05:09:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:28,342 INFO L225 Difference]: With dead ends: 41 [2020-08-19 05:09:28,342 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 05:09:28,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 05:09:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 05:09:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 05:09:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 05:09:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 05:09:28,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 05:09:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:28,356 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 05:09:28,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 05:09:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 05:09:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 05:09:28,359 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:28,359 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:28,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 05:09:28,359 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 05:09:28,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:28,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656602396] [2020-08-19 05:09:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-19 05:09:28,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656602396] [2020-08-19 05:09:28,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:28,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 05:09:28,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21054394] [2020-08-19 05:09:28,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 05:09:28,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 05:09:28,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 05:09:28,596 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 05:09:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:28,726 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 05:09:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 05:09:28,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 05:09:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:28,729 INFO L225 Difference]: With dead ends: 76 [2020-08-19 05:09:28,729 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 05:09:28,730 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-19 05:09:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 05:09:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 05:09:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 05:09:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 05:09:28,742 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 05:09:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:28,743 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 05:09:28,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 05:09:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 05:09:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 05:09:28,745 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:28,745 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:28,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 05:09:28,746 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:28,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:28,746 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 05:09:28,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:28,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422967949] [2020-08-19 05:09:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-19 05:09:28,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422967949] [2020-08-19 05:09:28,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:28,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 05:09:28,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672784797] [2020-08-19 05:09:28,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 05:09:28,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 05:09:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 05:09:28,881 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 05:09:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:29,002 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 05:09:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 05:09:29,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 05:09:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:29,005 INFO L225 Difference]: With dead ends: 62 [2020-08-19 05:09:29,005 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 05:09:29,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 05:09:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 05:09:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 05:09:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 05:09:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 05:09:29,019 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 05:09:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:29,020 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 05:09:29,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 05:09:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 05:09:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 05:09:29,025 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:29,025 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:29,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 05:09:29,026 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 05:09:29,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:29,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [568036470] [2020-08-19 05:09:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-19 05:09:29,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [568036470] [2020-08-19 05:09:29,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:29,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 05:09:29,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703342388] [2020-08-19 05:09:29,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 05:09:29,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 05:09:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 05:09:29,307 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 05:09:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:29,486 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 05:09:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 05:09:29,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 05:09:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:29,494 INFO L225 Difference]: With dead ends: 97 [2020-08-19 05:09:29,494 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 05:09:29,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-19 05:09:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 05:09:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 05:09:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 05:09:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 05:09:29,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 05:09:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:29,540 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 05:09:29,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 05:09:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 05:09:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 05:09:29,553 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:29,558 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:29,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 05:09:29,558 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 05:09:29,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:29,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2040312955] [2020-08-19 05:09:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:29,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-19 05:09:30,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2040312955] [2020-08-19 05:09:30,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:30,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 05:09:30,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947175886] [2020-08-19 05:09:30,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 05:09:30,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 05:09:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 05:09:30,019 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 05:09:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:30,448 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 05:09:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 05:09:30,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 05:09:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:30,451 INFO L225 Difference]: With dead ends: 153 [2020-08-19 05:09:30,451 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 05:09:30,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-19 05:09:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 05:09:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 05:09:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 05:09:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 05:09:30,479 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 05:09:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:30,481 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 05:09:30,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 05:09:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 05:09:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 05:09:30,485 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:30,487 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:30,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 05:09:30,488 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 05:09:30,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:30,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2123389805] [2020-08-19 05:09:30,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-19 05:09:30,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2123389805] [2020-08-19 05:09:30,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:30,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 05:09:30,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128201857] [2020-08-19 05:09:30,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 05:09:30,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 05:09:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 05:09:30,736 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 05:09:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:30,910 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 05:09:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 05:09:30,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 05:09:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:30,913 INFO L225 Difference]: With dead ends: 68 [2020-08-19 05:09:30,913 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 05:09:30,914 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-19 05:09:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 05:09:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 05:09:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 05:09:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 05:09:30,923 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 05:09:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:30,923 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 05:09:30,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 05:09:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 05:09:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 05:09:30,926 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:30,926 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:30,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 05:09:30,926 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 05:09:30,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:30,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1802266403] [2020-08-19 05:09:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 05:09:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-19 05:09:31,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1802266403] [2020-08-19 05:09:31,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:31,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 05:09:31,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125700409] [2020-08-19 05:09:31,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 05:09:31,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:31,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 05:09:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 05:09:31,328 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 05:09:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:31,573 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 05:09:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 05:09:31,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 05:09:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:31,581 INFO L225 Difference]: With dead ends: 180 [2020-08-19 05:09:31,581 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 05:09:31,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 05:09:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 05:09:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 05:09:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 05:09:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 05:09:31,629 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 05:09:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:31,630 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 05:09:31,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 05:09:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 05:09:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 05:09:31,641 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:31,641 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:31,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 05:09:31,642 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 05:09:31,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:31,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1664856438] [2020-08-19 05:09:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:31,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 05:09:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 05:09:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-19 05:09:32,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1664856438] [2020-08-19 05:09:32,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:32,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 05:09:32,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743040453] [2020-08-19 05:09:32,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 05:09:32,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:32,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 05:09:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 05:09:32,522 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 05:09:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:32,811 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 05:09:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 05:09:32,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 05:09:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:32,817 INFO L225 Difference]: With dead ends: 410 [2020-08-19 05:09:32,817 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 05:09:32,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-19 05:09:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 05:09:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 05:09:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 05:09:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 05:09:32,878 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 05:09:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:32,879 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 05:09:32,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 05:09:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 05:09:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-19 05:09:32,891 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:32,892 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:32,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 05:09:32,893 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-19 05:09:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:32,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874462661] [2020-08-19 05:09:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 05:09:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 05:09:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 05:09:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 05:09:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 05:09:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:33,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 05:09:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 05:09:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 05:09:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 05:09:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 05:09:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 05:09:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 05:09:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 05:09:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-19 05:09:34,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874462661] [2020-08-19 05:09:34,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 05:09:34,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 05:09:34,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810395769] [2020-08-19 05:09:34,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 05:09:34,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 05:09:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 05:09:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-19 05:09:34,800 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-19 05:09:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 05:09:35,660 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-19 05:09:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-19 05:09:35,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-19 05:09:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 05:09:35,663 INFO L225 Difference]: With dead ends: 531 [2020-08-19 05:09:35,663 INFO L226 Difference]: Without dead ends: 148 [2020-08-19 05:09:35,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-19 05:09:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-19 05:09:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-19 05:09:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-19 05:09:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-19 05:09:35,684 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-19 05:09:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 05:09:35,685 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-19 05:09:35,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 05:09:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-19 05:09:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 05:09:35,695 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 05:09:35,695 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 05:09:35,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 05:09:35,696 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 05:09:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 05:09:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-19 05:09:35,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 05:09:35,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985810252] [2020-08-19 05:09:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 05:09:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 05:09:35,796 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 05:09:35,796 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 05:09:35,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 05:09:35,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 05:09:35 BoogieIcfgContainer [2020-08-19 05:09:35,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 05:09:35,889 INFO L168 Benchmark]: Toolchain (without parser) took 9487.06 ms. Allocated memory was 146.8 MB in the beginning and 491.3 MB in the end (delta: 344.5 MB). Free memory was 103.0 MB in the beginning and 155.1 MB in the end (delta: -52.1 MB). Peak memory consumption was 292.4 MB. Max. memory is 7.1 GB. [2020-08-19 05:09:35,890 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 05:09:35,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.26 ms. Allocated memory is still 146.8 MB. Free memory was 102.8 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 05:09:35,893 INFO L168 Benchmark]: Boogie Preprocessor took 125.69 ms. Allocated memory was 146.8 MB in the beginning and 201.3 MB in the end (delta: 54.5 MB). Free memory was 93.5 MB in the beginning and 180.0 MB in the end (delta: -86.5 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-08-19 05:09:35,893 INFO L168 Benchmark]: RCFGBuilder took 233.88 ms. Allocated memory is still 201.3 MB. Free memory was 179.3 MB in the beginning and 167.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-08-19 05:09:35,898 INFO L168 Benchmark]: TraceAbstraction took 8842.29 ms. Allocated memory was 201.3 MB in the beginning and 491.3 MB in the end (delta: 289.9 MB). Free memory was 167.4 MB in the beginning and 155.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 302.2 MB. Max. memory is 7.1 GB. [2020-08-19 05:09:35,904 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.25 ms. Allocated memory is still 146.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.26 ms. Allocated memory is still 146.8 MB. Free memory was 102.8 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.69 ms. Allocated memory was 146.8 MB in the beginning and 201.3 MB in the end (delta: 54.5 MB). Free memory was 93.5 MB in the beginning and 180.0 MB in the end (delta: -86.5 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 233.88 ms. Allocated memory is still 201.3 MB. Free memory was 179.3 MB in the beginning and 167.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8842.29 ms. Allocated memory was 201.3 MB in the beginning and 491.3 MB in the end (delta: 289.9 MB). Free memory was 167.4 MB in the beginning and 155.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 302.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.7s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1338 SolverSat, 484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...