/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.5 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 06:14:30,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 06:14:30,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 06:14:30,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 06:14:30,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 06:14:30,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 06:14:30,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 06:14:30,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 06:14:30,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 06:14:30,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 06:14:30,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 06:14:30,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 06:14:30,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 06:14:30,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 06:14:30,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 06:14:30,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 06:14:30,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 06:14:30,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 06:14:30,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 06:14:30,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 06:14:30,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 06:14:30,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 06:14:30,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 06:14:30,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 06:14:30,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 06:14:30,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 06:14:30,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 06:14:30,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 06:14:30,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 06:14:30,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 06:14:30,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 06:14:30,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 06:14:30,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 06:14:30,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 06:14:30,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 06:14:30,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 06:14:30,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 06:14:30,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 06:14:30,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 06:14:30,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 06:14:30,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 06:14:30,578 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-22 06:14:30,626 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 06:14:30,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 06:14:30,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 06:14:30,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 06:14:30,629 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 06:14:30,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 06:14:30,630 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 06:14:30,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 06:14:30,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 06:14:30,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 06:14:30,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 06:14:30,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 06:14:30,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 06:14:30,633 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 06:14:30,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 06:14:30,633 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 06:14:30,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 06:14:30,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 06:14:30,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 06:14:30,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 06:14:30,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 06:14:30,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 06:14:30,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 06:14:30,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 06:14:30,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 06:14:30,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 06:14:30,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 06:14:30,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 06:14:30,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 06:14:30,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.5;log-additional-information=true; [2020-08-22 06:14:30,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 06:14:30,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 06:14:30,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 06:14:30,990 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 06:14:30,990 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 06:14:30,991 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-22 06:14:31,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ad8b28509/4a2172da67db492399da30f30ca3177c/FLAGb3e3b8c15 [2020-08-22 06:14:31,582 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 06:14:31,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 06:14:31,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ad8b28509/4a2172da67db492399da30f30ca3177c/FLAGb3e3b8c15 [2020-08-22 06:14:31,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ad8b28509/4a2172da67db492399da30f30ca3177c [2020-08-22 06:14:31,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 06:14:31,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 06:14:31,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 06:14:31,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 06:14:31,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 06:14:31,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:14:31" (1/1) ... [2020-08-22 06:14:31,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41395291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:31, skipping insertion in model container [2020-08-22 06:14:31,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:14:31" (1/1) ... [2020-08-22 06:14:31,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 06:14:31,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 06:14:32,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 06:14:32,092 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 06:14:32,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 06:14:32,118 INFO L208 MainTranslator]: Completed translation [2020-08-22 06:14:32,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32 WrapperNode [2020-08-22 06:14:32,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 06:14:32,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 06:14:32,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 06:14:32,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 06:14:32,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (1/1) ... [2020-08-22 06:14:32,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 06:14:32,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 06:14:32,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 06:14:32,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 06:14:32,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (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-22 06:14:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 06:14:32,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 06:14:32,297 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 06:14:32,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 06:14:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 06:14:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 06:14:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 06:14:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 06:14:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 06:14:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 06:14:32,477 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 06:14:32,478 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 06:14:32,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:14:32 BoogieIcfgContainer [2020-08-22 06:14:32,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 06:14:32,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 06:14:32,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 06:14:32,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 06:14:32,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:14:31" (1/3) ... [2020-08-22 06:14:32,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e58b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:14:32, skipping insertion in model container [2020-08-22 06:14:32,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:14:32" (2/3) ... [2020-08-22 06:14:32,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e58b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:14:32, skipping insertion in model container [2020-08-22 06:14:32,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:14:32" (3/3) ... [2020-08-22 06:14:32,492 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 06:14:32,505 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 06:14:32,517 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 06:14:32,533 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 06:14:32,566 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 06:14:32,566 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 06:14:32,567 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 06:14:32,567 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 06:14:32,567 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 06:14:32,567 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 06:14:32,567 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 06:14:32,568 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 06:14:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-22 06:14:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 06:14:32,606 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:32,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:32,608 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-22 06:14:32,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:32,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956932345] [2020-08-22 06:14:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:32,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:32,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:32,855 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-22 06:14:32,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956932345] [2020-08-22 06:14:32,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 06:14:32,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 06:14:32,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873760298] [2020-08-22 06:14:32,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 06:14:32,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 06:14:32,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 06:14:32,889 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-22 06:14:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:33,002 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 06:14:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 06:14:33,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 06:14:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:33,019 INFO L225 Difference]: With dead ends: 35 [2020-08-22 06:14:33,019 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 06:14:33,023 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-22 06:14:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 06:14:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 06:14:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 06:14:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 06:14:33,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 06:14:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:33,074 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 06:14:33,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 06:14:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 06:14:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 06:14:33,076 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:33,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 06:14:33,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 06:14:33,078 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-22 06:14:33,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:33,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512222348] [2020-08-22 06:14:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,148 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-22 06:14:33,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512222348] [2020-08-22 06:14:33,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 06:14:33,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 06:14:33,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784261665] [2020-08-22 06:14:33,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 06:14:33,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:33,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 06:14:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 06:14:33,153 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 06:14:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:33,216 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 06:14:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 06:14:33,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 06:14:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:33,219 INFO L225 Difference]: With dead ends: 27 [2020-08-22 06:14:33,219 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 06:14:33,220 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-22 06:14:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 06:14:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 06:14:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 06:14:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 06:14:33,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 06:14:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:33,229 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 06:14:33,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 06:14:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 06:14:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 06:14:33,231 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:33,232 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-22 06:14:33,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 06:14:33,232 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-22 06:14:33,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:33,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1937853582] [2020-08-22 06:14:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 06:14:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,389 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-22 06:14:33,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1937853582] [2020-08-22 06:14:33,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:33,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 06:14:33,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411599328] [2020-08-22 06:14:33,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 06:14:33,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 06:14:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 06:14:33,392 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-22 06:14:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:33,488 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 06:14:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 06:14:33,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-22 06:14:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:33,491 INFO L225 Difference]: With dead ends: 38 [2020-08-22 06:14:33,491 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 06:14:33,492 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-22 06:14:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 06:14:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 06:14:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 06:14:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 06:14:33,500 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 06:14:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:33,500 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 06:14:33,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 06:14:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 06:14:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 06:14:33,502 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:33,503 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-22 06:14:33,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 06:14:33,503 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-22 06:14:33,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:33,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141658076] [2020-08-22 06:14:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,608 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-22 06:14:33,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141658076] [2020-08-22 06:14:33,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:33,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 06:14:33,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658307992] [2020-08-22 06:14:33,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 06:14:33,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 06:14:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 06:14:33,611 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 06:14:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:33,769 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 06:14:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 06:14:33,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 06:14:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:33,774 INFO L225 Difference]: With dead ends: 41 [2020-08-22 06:14:33,774 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 06:14:33,775 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-22 06:14:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 06:14:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 06:14:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 06:14:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 06:14:33,796 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 06:14:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:33,801 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 06:14:33,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 06:14:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 06:14:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 06:14:33,803 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:33,804 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-22 06:14:33,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 06:14:33,805 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:33,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-22 06:14:33,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:33,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104538763] [2020-08-22 06:14:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:33,967 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-22 06:14:33,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104538763] [2020-08-22 06:14:33,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:33,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 06:14:33,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839546475] [2020-08-22 06:14:33,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 06:14:33,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 06:14:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 06:14:33,970 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-22 06:14:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:34,092 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-22 06:14:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 06:14:34,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-22 06:14:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:34,096 INFO L225 Difference]: With dead ends: 76 [2020-08-22 06:14:34,096 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 06:14:34,097 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-22 06:14:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 06:14:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-22 06:14:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-22 06:14:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-22 06:14:34,110 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-22 06:14:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:34,110 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-22 06:14:34,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 06:14:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-22 06:14:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 06:14:34,112 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:34,113 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-22 06:14:34,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 06:14:34,113 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-22 06:14:34,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:34,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129713401] [2020-08-22 06:14:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,259 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-22 06:14:34,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129713401] [2020-08-22 06:14:34,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:34,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 06:14:34,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219457934] [2020-08-22 06:14:34,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 06:14:34,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 06:14:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 06:14:34,262 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-22 06:14:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:34,379 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-22 06:14:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 06:14:34,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 06:14:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:34,382 INFO L225 Difference]: With dead ends: 62 [2020-08-22 06:14:34,382 INFO L226 Difference]: Without dead ends: 58 [2020-08-22 06:14:34,383 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-22 06:14:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-22 06:14:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-22 06:14:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 06:14:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-22 06:14:34,396 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-22 06:14:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:34,397 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-22 06:14:34,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 06:14:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-22 06:14:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-22 06:14:34,401 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:34,402 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-22 06:14:34,402 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 06:14:34,402 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-22 06:14:34,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:34,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236862615] [2020-08-22 06:14:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:34,816 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-22 06:14:34,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236862615] [2020-08-22 06:14:34,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:34,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 06:14:34,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915462603] [2020-08-22 06:14:34,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 06:14:34,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 06:14:34,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 06:14:34,821 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-22 06:14:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:34,998 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-22 06:14:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 06:14:34,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-22 06:14:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:35,005 INFO L225 Difference]: With dead ends: 97 [2020-08-22 06:14:35,005 INFO L226 Difference]: Without dead ends: 93 [2020-08-22 06:14:35,006 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-22 06:14:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-22 06:14:35,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-22 06:14:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 06:14:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-22 06:14:35,025 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-22 06:14:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:35,026 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-22 06:14:35,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 06:14:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-22 06:14:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 06:14:35,030 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:35,030 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-22 06:14:35,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 06:14:35,031 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-22 06:14:35,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:35,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101073112] [2020-08-22 06:14:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,422 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-22 06:14:35,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101073112] [2020-08-22 06:14:35,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:35,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 06:14:35,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417681320] [2020-08-22 06:14:35,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 06:14:35,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 06:14:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 06:14:35,425 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-22 06:14:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:35,824 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-22 06:14:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 06:14:35,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-22 06:14:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:35,827 INFO L225 Difference]: With dead ends: 153 [2020-08-22 06:14:35,827 INFO L226 Difference]: Without dead ends: 71 [2020-08-22 06:14:35,838 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-22 06:14:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-22 06:14:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-22 06:14:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 06:14:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-22 06:14:35,859 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-22 06:14:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:35,860 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-22 06:14:35,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 06:14:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-22 06:14:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 06:14:35,862 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:35,862 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-22 06:14:35,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 06:14:35,868 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:35,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:35,868 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-22 06:14:35,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:35,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1458599190] [2020-08-22 06:14:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:35,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,169 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-22 06:14:36,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1458599190] [2020-08-22 06:14:36,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:36,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 06:14:36,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140576677] [2020-08-22 06:14:36,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 06:14:36,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:36,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 06:14:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 06:14:36,173 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-22 06:14:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:36,334 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-22 06:14:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 06:14:36,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-22 06:14:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:36,339 INFO L225 Difference]: With dead ends: 68 [2020-08-22 06:14:36,339 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 06:14:36,340 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-22 06:14:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 06:14:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-22 06:14:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 06:14:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-22 06:14:36,360 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-22 06:14:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:36,365 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-22 06:14:36,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 06:14:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-22 06:14:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 06:14:36,368 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:36,368 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-22 06:14:36,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 06:14:36,369 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:36,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:36,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-22 06:14:36,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:36,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536718018] [2020-08-22 06:14:36,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:36,766 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-22 06:14:36,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536718018] [2020-08-22 06:14:36,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:36,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 06:14:36,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618790718] [2020-08-22 06:14:36,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 06:14:36,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:36,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 06:14:36,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 06:14:36,769 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-22 06:14:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:36,999 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-22 06:14:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 06:14:36,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 06:14:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:37,003 INFO L225 Difference]: With dead ends: 180 [2020-08-22 06:14:37,003 INFO L226 Difference]: Without dead ends: 176 [2020-08-22 06:14:37,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-22 06:14:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-22 06:14:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-22 06:14:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-22 06:14:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-22 06:14:37,026 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-22 06:14:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:37,027 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-22 06:14:37,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 06:14:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-22 06:14:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 06:14:37,031 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:37,032 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-22 06:14:37,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 06:14:37,032 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:37,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-22 06:14:37,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:37,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039776412] [2020-08-22 06:14:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:37,763 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-22 06:14:37,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039776412] [2020-08-22 06:14:37,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:37,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 06:14:37,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020437226] [2020-08-22 06:14:37,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 06:14:37,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 06:14:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 06:14:37,768 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-22 06:14:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:38,115 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-22 06:14:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 06:14:38,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-22 06:14:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:38,123 INFO L225 Difference]: With dead ends: 410 [2020-08-22 06:14:38,123 INFO L226 Difference]: Without dead ends: 406 [2020-08-22 06:14:38,125 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-22 06:14:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-22 06:14:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-22 06:14:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-22 06:14:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-22 06:14:38,209 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-22 06:14:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:38,212 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-22 06:14:38,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 06:14:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-22 06:14:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-22 06:14:38,225 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:38,226 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-22 06:14:38,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 06:14:38,226 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-22 06:14:38,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:38,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996371186] [2020-08-22 06:14:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 06:14:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 06:14:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:38,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 06:14:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 06:14:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 06:14:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 06:14:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 06:14:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 06:14:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 06:14:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:39,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 06:14:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 06:14:40,402 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-22 06:14:40,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996371186] [2020-08-22 06:14:40,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 06:14:40,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-22 06:14:40,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244955886] [2020-08-22 06:14:40,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 06:14:40,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 06:14:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 06:14:40,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-22 06:14:40,405 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-22 06:14:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 06:14:41,347 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-22 06:14:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 06:14:41,348 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-22 06:14:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 06:14:41,354 INFO L225 Difference]: With dead ends: 531 [2020-08-22 06:14:41,354 INFO L226 Difference]: Without dead ends: 148 [2020-08-22 06:14:41,359 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-22 06:14:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-22 06:14:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-22 06:14:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-22 06:14:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-22 06:14:41,370 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-22 06:14:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 06:14:41,374 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-22 06:14:41,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 06:14:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-22 06:14:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-22 06:14:41,394 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 06:14:41,394 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-22 06:14:41,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 06:14:41,394 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 06:14:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 06:14:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-22 06:14:41,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 06:14:41,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1713827953] [2020-08-22 06:14:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 06:14:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 06:14:41,496 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 06:14:41,496 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 06:14:41,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 06:14:41,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 06:14:41 BoogieIcfgContainer [2020-08-22 06:14:41,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 06:14:41,589 INFO L168 Benchmark]: Toolchain (without parser) took 9684.90 ms. Allocated memory was 140.5 MB in the beginning and 529.5 MB in the end (delta: 389.0 MB). Free memory was 103.8 MB in the beginning and 419.7 MB in the end (delta: -315.9 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:41,590 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 06:14:41,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.90 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:41,591 INFO L168 Benchmark]: Boogie Preprocessor took 25.01 ms. Allocated memory is still 140.5 MB. Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:41,592 INFO L168 Benchmark]: RCFGBuilder took 337.82 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 171.8 MB in the end (delta: -79.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:41,593 INFO L168 Benchmark]: TraceAbstraction took 9101.58 ms. Allocated memory was 204.5 MB in the beginning and 529.5 MB in the end (delta: 325.1 MB). Free memory was 171.8 MB in the beginning and 419.7 MB in the end (delta: -247.9 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. [2020-08-22 06:14:41,597 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.97 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 212.90 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 94.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.01 ms. Allocated memory is still 140.5 MB. Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.82 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 171.8 MB in the end (delta: -79.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9101.58 ms. Allocated memory was 204.5 MB in the beginning and 529.5 MB in the end (delta: 325.1 MB). Free memory was 171.8 MB in the beginning and 419.7 MB in the end (delta: -247.9 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.9s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1357 SolverSat, 480 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.3s 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...