/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.5 -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 06:46:27,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 06:46:27,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 06:46:27,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 06:46:27,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 06:46:27,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 06:46:27,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 06:46:27,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 06:46:27,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 06:46:27,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 06:46:27,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 06:46:27,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 06:46:27,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 06:46:27,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 06:46:27,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 06:46:27,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 06:46:27,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 06:46:27,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 06:46:27,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 06:46:27,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 06:46:27,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 06:46:27,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 06:46:27,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 06:46:27,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 06:46:27,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 06:46:27,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 06:46:27,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 06:46:27,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 06:46:27,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 06:46:27,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 06:46:27,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 06:46:27,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 06:46:27,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 06:46:27,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 06:46:27,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 06:46:27,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 06:46:27,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 06:46:27,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 06:46:27,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 06:46:27,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 06:46:27,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 06:46:27,946 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 06:46:28,000 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 06:46:28,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 06:46:28,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 06:46:28,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 06:46:28,002 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 06:46:28,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 06:46:28,003 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 06:46:28,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 06:46:28,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 06:46:28,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 06:46:28,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 06:46:28,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 06:46:28,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 06:46:28,004 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 06:46:28,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 06:46:28,005 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 06:46:28,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 06:46:28,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 06:46:28,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 06:46:28,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 06:46:28,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 06:46:28,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 06:46:28,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 06:46:28,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 06:46:28,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 06:46:28,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 06:46:28,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 06:46:28,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 06:46:28,008 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 06:46:28,009 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.5; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5; [2020-08-19 06:46:28,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 06:46:28,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 06:46:28,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 06:46:28,381 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 06:46:28,381 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 06:46:28,382 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 06:46:28,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a2d619e69/6c69f3a2835f4e6faa45a1ee037539f8/FLAG50965b31a [2020-08-19 06:46:28,890 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 06:46:28,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 06:46:28,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a2d619e69/6c69f3a2835f4e6faa45a1ee037539f8/FLAG50965b31a [2020-08-19 06:46:29,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a2d619e69/6c69f3a2835f4e6faa45a1ee037539f8 [2020-08-19 06:46:29,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 06:46:29,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 06:46:29,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 06:46:29,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 06:46:29,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 06:46:29,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78532141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29, skipping insertion in model container [2020-08-19 06:46:29,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 06:46:29,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 06:46:29,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 06:46:29,495 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 06:46:29,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 06:46:29,519 INFO L208 MainTranslator]: Completed translation [2020-08-19 06:46:29,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29 WrapperNode [2020-08-19 06:46:29,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 06:46:29,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 06:46:29,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 06:46:29,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 06:46:29,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (1/1) ... [2020-08-19 06:46:29,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 06:46:29,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 06:46:29,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 06:46:29,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 06:46:29,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (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 06:46:29,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 06:46:29,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 06:46:29,672 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 06:46:29,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 06:46:29,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 06:46:29,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 06:46:29,672 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 06:46:29,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 06:46:29,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 06:46:29,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 06:46:29,847 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 06:46:29,847 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 06:46:29,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 06:46:29 BoogieIcfgContainer [2020-08-19 06:46:29,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 06:46:29,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 06:46:29,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 06:46:29,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 06:46:29,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 06:46:29" (1/3) ... [2020-08-19 06:46:29,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 06:46:29, skipping insertion in model container [2020-08-19 06:46:29,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 06:46:29" (2/3) ... [2020-08-19 06:46:29,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0337c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 06:46:29, skipping insertion in model container [2020-08-19 06:46:29,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 06:46:29" (3/3) ... [2020-08-19 06:46:29,860 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 06:46:29,871 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 06:46:29,879 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 06:46:29,894 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 06:46:29,944 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 06:46:29,944 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 06:46:29,945 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 06:46:29,945 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 06:46:29,945 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 06:46:29,945 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 06:46:29,945 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 06:46:29,945 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 06:46:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 06:46:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 06:46:30,000 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:30,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:30,002 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:30,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 06:46:30,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:30,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038828925] [2020-08-19 06:46:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,264 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 06:46:30,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038828925] [2020-08-19 06:46:30,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:46:30,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 06:46:30,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187840931] [2020-08-19 06:46:30,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 06:46:30,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 06:46:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 06:46:30,286 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 06:46:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:30,401 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 06:46:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:46:30,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 06:46:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:30,414 INFO L225 Difference]: With dead ends: 35 [2020-08-19 06:46:30,415 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 06:46:30,418 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 06:46:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 06:46:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 06:46:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 06:46:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 06:46:30,461 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 06:46:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:30,462 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 06:46:30,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 06:46:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 06:46:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 06:46:30,464 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:30,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 06:46:30,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 06:46:30,465 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 06:46:30,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:30,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355208162] [2020-08-19 06:46:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,537 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 06:46:30,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355208162] [2020-08-19 06:46:30,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 06:46:30,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 06:46:30,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314160009] [2020-08-19 06:46:30,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 06:46:30,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 06:46:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 06:46:30,542 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 06:46:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:30,611 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 06:46:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 06:46:30,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 06:46:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:30,613 INFO L225 Difference]: With dead ends: 27 [2020-08-19 06:46:30,613 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 06:46:30,614 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 06:46:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 06:46:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 06:46:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 06:46:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 06:46:30,622 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 06:46:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:30,622 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 06:46:30,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 06:46:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 06:46:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 06:46:30,624 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:30,624 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 06:46:30,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 06:46:30,625 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 06:46:30,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:30,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323685554] [2020-08-19 06:46:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 06:46:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,768 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 06:46:30,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323685554] [2020-08-19 06:46:30,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:30,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 06:46:30,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876384617] [2020-08-19 06:46:30,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 06:46:30,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 06:46:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:46:30,771 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 06:46:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:30,856 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 06:46:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 06:46:30,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 06:46:30,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:30,858 INFO L225 Difference]: With dead ends: 38 [2020-08-19 06:46:30,858 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 06:46:30,859 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 06:46:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 06:46:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 06:46:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 06:46:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 06:46:30,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 06:46:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:30,868 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 06:46:30,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 06:46:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 06:46:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 06:46:30,870 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:30,870 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 06:46:30,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 06:46:30,871 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 06:46:30,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:30,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243913148] [2020-08-19 06:46:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:30,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,002 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 06:46:31,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243913148] [2020-08-19 06:46:31,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:31,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 06:46:31,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193349791] [2020-08-19 06:46:31,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 06:46:31,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:31,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 06:46:31,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 06:46:31,006 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 06:46:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:31,120 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 06:46:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 06:46:31,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 06:46:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:31,124 INFO L225 Difference]: With dead ends: 41 [2020-08-19 06:46:31,124 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 06:46:31,125 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 06:46:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 06:46:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 06:46:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 06:46:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 06:46:31,137 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 06:46:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:31,137 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 06:46:31,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 06:46:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 06:46:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 06:46:31,140 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:31,140 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 06:46:31,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 06:46:31,140 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 06:46:31,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:31,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109286994] [2020-08-19 06:46:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,305 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 06:46:31,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109286994] [2020-08-19 06:46:31,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:31,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 06:46:31,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206069771] [2020-08-19 06:46:31,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 06:46:31,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 06:46:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:46:31,310 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 06:46:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:31,464 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 06:46:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 06:46:31,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 06:46:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:31,467 INFO L225 Difference]: With dead ends: 76 [2020-08-19 06:46:31,467 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 06:46:31,469 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 06:46:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 06:46:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 06:46:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 06:46:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 06:46:31,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 06:46:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:31,482 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 06:46:31,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 06:46:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 06:46:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 06:46:31,485 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:31,485 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 06:46:31,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 06:46:31,485 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 06:46:31,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:31,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1868628538] [2020-08-19 06:46:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,611 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 06:46:31,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1868628538] [2020-08-19 06:46:31,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:31,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 06:46:31,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260203719] [2020-08-19 06:46:31,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 06:46:31,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:31,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 06:46:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 06:46:31,614 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 06:46:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:31,722 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 06:46:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 06:46:31,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 06:46:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:31,725 INFO L225 Difference]: With dead ends: 62 [2020-08-19 06:46:31,725 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 06:46:31,726 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 06:46:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 06:46:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 06:46:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 06:46:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 06:46:31,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 06:46:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:31,742 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 06:46:31,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 06:46:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 06:46:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 06:46:31,755 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:31,756 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 06:46:31,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 06:46:31,756 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 06:46:31,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:31,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727398220] [2020-08-19 06:46:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:31,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,132 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 06:46:32,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727398220] [2020-08-19 06:46:32,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:32,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 06:46:32,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938846042] [2020-08-19 06:46:32,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 06:46:32,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 06:46:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 06:46:32,135 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 06:46:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:32,290 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 06:46:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 06:46:32,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 06:46:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:32,295 INFO L225 Difference]: With dead ends: 97 [2020-08-19 06:46:32,295 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 06:46:32,296 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 06:46:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 06:46:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 06:46:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 06:46:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 06:46:32,317 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 06:46:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:32,317 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 06:46:32,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 06:46:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 06:46:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 06:46:32,323 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:32,324 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 06:46:32,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 06:46:32,324 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 06:46:32,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:32,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346787066] [2020-08-19 06:46:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:32,725 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 06:46:32,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346787066] [2020-08-19 06:46:32,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:32,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 06:46:32,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583186365] [2020-08-19 06:46:32,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 06:46:32,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:32,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 06:46:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 06:46:32,729 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 06:46:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:33,146 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 06:46:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 06:46:33,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 06:46:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:33,149 INFO L225 Difference]: With dead ends: 153 [2020-08-19 06:46:33,149 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 06:46:33,152 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 06:46:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 06:46:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 06:46:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 06:46:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 06:46:33,162 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 06:46:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:33,163 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 06:46:33,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 06:46:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 06:46:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 06:46:33,164 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:33,164 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 06:46:33,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 06:46:33,165 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 06:46:33,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:33,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041982514] [2020-08-19 06:46:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,468 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 06:46:33,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041982514] [2020-08-19 06:46:33,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:33,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 06:46:33,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811100693] [2020-08-19 06:46:33,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 06:46:33,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:33,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 06:46:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 06:46:33,477 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 06:46:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:33,659 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 06:46:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 06:46:33,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 06:46:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:33,663 INFO L225 Difference]: With dead ends: 68 [2020-08-19 06:46:33,663 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 06:46:33,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 06:46:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 06:46:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 06:46:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 06:46:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 06:46:33,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 06:46:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:33,683 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 06:46:33,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 06:46:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 06:46:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 06:46:33,688 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:33,689 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 06:46:33,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 06:46:33,689 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 06:46:33,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:33,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060652959] [2020-08-19 06:46:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:33,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,048 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 06:46:34,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060652959] [2020-08-19 06:46:34,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:34,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 06:46:34,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825684658] [2020-08-19 06:46:34,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 06:46:34,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 06:46:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 06:46:34,058 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 06:46:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:34,279 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 06:46:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 06:46:34,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 06:46:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:34,285 INFO L225 Difference]: With dead ends: 180 [2020-08-19 06:46:34,285 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 06:46:34,287 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 06:46:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 06:46:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 06:46:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 06:46:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 06:46:34,339 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 06:46:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:34,342 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 06:46:34,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 06:46:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 06:46:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 06:46:34,355 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:34,355 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 06:46:34,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 06:46:34,355 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 06:46:34,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:34,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1281970261] [2020-08-19 06:46:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:34,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,218 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 06:46:35,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1281970261] [2020-08-19 06:46:35,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:35,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 06:46:35,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788719028] [2020-08-19 06:46:35,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 06:46:35,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 06:46:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 06:46:35,221 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 06:46:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:35,495 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 06:46:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 06:46:35,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 06:46:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:35,501 INFO L225 Difference]: With dead ends: 410 [2020-08-19 06:46:35,501 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 06:46:35,502 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 06:46:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 06:46:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 06:46:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 06:46:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 06:46:35,545 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 06:46:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:35,546 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 06:46:35,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 06:46:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 06:46:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-19 06:46:35,559 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:35,559 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 06:46:35,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 06:46:35,560 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:35,560 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-19 06:46:35,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:35,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636102097] [2020-08-19 06:46:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 06:46:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:35,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 06:46:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 06:46:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 06:46:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 06:46:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:36,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 06:46:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 06:46:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 06:46:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 06:46:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 06:46:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 06:46:37,509 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 06:46:37,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1636102097] [2020-08-19 06:46:37,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 06:46:37,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 06:46:37,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516460489] [2020-08-19 06:46:37,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 06:46:37,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 06:46:37,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 06:46:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-19 06:46:37,513 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-19 06:46:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 06:46:38,491 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-19 06:46:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-19 06:46:38,492 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-19 06:46:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 06:46:38,498 INFO L225 Difference]: With dead ends: 531 [2020-08-19 06:46:38,498 INFO L226 Difference]: Without dead ends: 148 [2020-08-19 06:46:38,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-19 06:46:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-19 06:46:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-19 06:46:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-19 06:46:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-19 06:46:38,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-19 06:46:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 06:46:38,518 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-19 06:46:38,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 06:46:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-19 06:46:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 06:46:38,528 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 06:46:38,529 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 06:46:38,529 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 06:46:38,529 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 06:46:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 06:46:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-19 06:46:38,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 06:46:38,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481191725] [2020-08-19 06:46:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 06:46:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 06:46:38,653 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 06:46:38,653 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 06:46:38,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 06:46:38,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 06:46:38 BoogieIcfgContainer [2020-08-19 06:46:38,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 06:46:38,746 INFO L168 Benchmark]: Toolchain (without parser) took 9447.24 ms. Allocated memory was 142.1 MB in the beginning and 530.1 MB in the end (delta: 388.0 MB). Free memory was 105.6 MB in the beginning and 313.5 MB in the end (delta: -207.9 MB). Peak memory consumption was 180.0 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:38,752 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 142.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 06:46:38,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.37 ms. Allocated memory is still 142.1 MB. Free memory was 105.2 MB in the beginning and 95.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:38,753 INFO L168 Benchmark]: Boogie Preprocessor took 93.72 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 95.9 MB in the beginning and 183.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:38,754 INFO L168 Benchmark]: RCFGBuilder took 237.55 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 171.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:38,755 INFO L168 Benchmark]: TraceAbstraction took 8891.15 ms. Allocated memory was 203.9 MB in the beginning and 530.1 MB in the end (delta: 326.1 MB). Free memory was 170.4 MB in the beginning and 313.5 MB in the end (delta: -143.1 MB). Peak memory consumption was 183.0 MB. Max. memory is 7.1 GB. [2020-08-19 06:46:38,758 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.17 ms. Allocated memory is still 142.1 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 217.37 ms. Allocated memory is still 142.1 MB. Free memory was 105.2 MB in the beginning and 95.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.72 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 95.9 MB in the beginning and 183.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 237.55 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 171.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8891.15 ms. Allocated memory was 203.9 MB in the beginning and 530.1 MB in the end (delta: 326.1 MB). Free memory was 170.4 MB in the beginning and 313.5 MB in the end (delta: -143.1 MB). Peak memory consumption was 183.0 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: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1340 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.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s 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...