/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=BIGGEST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 17:18:10,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 17:18:10,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 17:18:10,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 17:18:10,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 17:18:10,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 17:18:10,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 17:18:10,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 17:18:10,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 17:18:10,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 17:18:10,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 17:18:10,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 17:18:10,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 17:18:10,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 17:18:10,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 17:18:10,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 17:18:10,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 17:18:10,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 17:18:10,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 17:18:10,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 17:18:10,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 17:18:10,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 17:18:10,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 17:18:10,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 17:18:10,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 17:18:10,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 17:18:10,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 17:18:10,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 17:18:10,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 17:18:10,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 17:18:10,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 17:18:10,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 17:18:10,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 17:18:10,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 17:18:10,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 17:18:10,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 17:18:10,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 17:18:10,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 17:18:10,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 17:18:10,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 17:18:10,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 17:18:10,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 17:18:10,480 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 17:18:10,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 17:18:10,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 17:18:10,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 17:18:10,482 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 17:18:10,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 17:18:10,483 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 17:18:10,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 17:18:10,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 17:18:10,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 17:18:10,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 17:18:10,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 17:18:10,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 17:18:10,484 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 17:18:10,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 17:18:10,485 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 17:18:10,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 17:18:10,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 17:18:10,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 17:18:10,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 17:18:10,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 17:18:10,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 17:18:10,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 17:18:10,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 17:18:10,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 17:18:10,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 17:18:10,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 17:18:10,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 17:18:10,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 17:18:10,488 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=BIGGEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=BIGGEST;log-additional-information=true; [2020-08-21 17:18:10,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 17:18:10,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 17:18:10,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 17:18:10,873 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 17:18:10,873 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 17:18:10,874 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 17:18:10,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/947932545/c497634f22a84c12b2e1b24e50e9873d/FLAGf9cfe24f4 [2020-08-21 17:18:11,379 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 17:18:11,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 17:18:11,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/947932545/c497634f22a84c12b2e1b24e50e9873d/FLAGf9cfe24f4 [2020-08-21 17:18:11,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/947932545/c497634f22a84c12b2e1b24e50e9873d [2020-08-21 17:18:11,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 17:18:11,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 17:18:11,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 17:18:11,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 17:18:11,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 17:18:11,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:18:11" (1/1) ... [2020-08-21 17:18:11,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4625cee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:11, skipping insertion in model container [2020-08-21 17:18:11,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:18:11" (1/1) ... [2020-08-21 17:18:11,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 17:18:11,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 17:18:11,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 17:18:11,990 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 17:18:12,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 17:18:12,022 INFO L208 MainTranslator]: Completed translation [2020-08-21 17:18:12,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12 WrapperNode [2020-08-21 17:18:12,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 17:18:12,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 17:18:12,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 17:18:12,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 17:18:12,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... [2020-08-21 17:18:12,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 17:18:12,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 17:18:12,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 17:18:12,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 17:18:12,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 17:18:12,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 17:18:12,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 17:18:12,216 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 17:18:12,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 17:18:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 17:18:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 17:18:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 17:18:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 17:18:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 17:18:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 17:18:12,395 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 17:18:12,395 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 17:18:12,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:18:12 BoogieIcfgContainer [2020-08-21 17:18:12,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 17:18:12,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 17:18:12,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 17:18:12,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 17:18:12,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:18:11" (1/3) ... [2020-08-21 17:18:12,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec229ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:18:12, skipping insertion in model container [2020-08-21 17:18:12,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:18:12" (2/3) ... [2020-08-21 17:18:12,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec229ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:18:12, skipping insertion in model container [2020-08-21 17:18:12,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:18:12" (3/3) ... [2020-08-21 17:18:12,408 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 17:18:12,418 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 17:18:12,426 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 17:18:12,441 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 17:18:12,465 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 17:18:12,465 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 17:18:12,465 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 17:18:12,466 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 17:18:12,466 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 17:18:12,466 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 17:18:12,466 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 17:18:12,466 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 17:18:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 17:18:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 17:18:12,491 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:12,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:12,492 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 17:18:12,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:12,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236363540] [2020-08-21 17:18:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:12,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:12,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:18:12,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236363540] [2020-08-21 17:18:12,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:18:12,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 17:18:12,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500538788] [2020-08-21 17:18:12,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 17:18:12,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:12,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 17:18:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 17:18:12,948 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 17:18:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:13,150 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 17:18:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:18:13,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 17:18:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:13,171 INFO L225 Difference]: With dead ends: 35 [2020-08-21 17:18:13,171 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 17:18:13,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:18:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 17:18:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 17:18:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 17:18:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 17:18:13,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 17:18:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:13,233 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 17:18:13,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 17:18:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 17:18:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 17:18:13,235 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:13,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:13,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 17:18:13,236 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 17:18:13,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:13,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709006677] [2020-08-21 17:18:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 17:18:13,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709006677] [2020-08-21 17:18:13,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 17:18:13,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 17:18:13,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203985543] [2020-08-21 17:18:13,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 17:18:13,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:13,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 17:18:13,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 17:18:13,322 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 17:18:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:13,394 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 17:18:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 17:18:13,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 17:18:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:13,397 INFO L225 Difference]: With dead ends: 27 [2020-08-21 17:18:13,397 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 17:18:13,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:18:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 17:18:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 17:18:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 17:18:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 17:18:13,407 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 17:18:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:13,408 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 17:18:13,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 17:18:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 17:18:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 17:18:13,410 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:13,410 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:13,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 17:18:13,411 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 17:18:13,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:13,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230422463] [2020-08-21 17:18:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 17:18:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-21 17:18:13,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230422463] [2020-08-21 17:18:13,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:13,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 17:18:13,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372722357] [2020-08-21 17:18:13,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 17:18:13,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:13,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 17:18:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:18:13,585 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 17:18:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:13,679 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 17:18:13,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 17:18:13,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 17:18:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:13,682 INFO L225 Difference]: With dead ends: 38 [2020-08-21 17:18:13,682 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 17:18:13,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-21 17:18:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 17:18:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 17:18:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 17:18:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 17:18:13,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 17:18:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:13,692 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 17:18:13,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 17:18:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 17:18:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 17:18:13,694 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:13,694 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:13,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 17:18:13,695 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:13,696 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 17:18:13,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:13,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292061799] [2020-08-21 17:18:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-21 17:18:13,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292061799] [2020-08-21 17:18:13,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:13,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 17:18:13,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205954412] [2020-08-21 17:18:13,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 17:18:13,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 17:18:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 17:18:13,807 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 17:18:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:13,930 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 17:18:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 17:18:13,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 17:18:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:13,933 INFO L225 Difference]: With dead ends: 41 [2020-08-21 17:18:13,933 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 17:18:13,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-21 17:18:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 17:18:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 17:18:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 17:18:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 17:18:13,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 17:18:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:13,947 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 17:18:13,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 17:18:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 17:18:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 17:18:13,949 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:13,949 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:13,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 17:18:13,950 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:13,950 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 17:18:13,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:13,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334008955] [2020-08-21 17:18:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-21 17:18:14,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334008955] [2020-08-21 17:18:14,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:14,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 17:18:14,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340331005] [2020-08-21 17:18:14,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 17:18:14,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:14,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 17:18:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 17:18:14,196 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 17:18:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:14,339 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 17:18:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 17:18:14,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 17:18:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:14,343 INFO L225 Difference]: With dead ends: 76 [2020-08-21 17:18:14,343 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 17:18:14,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:18:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 17:18:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 17:18:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 17:18:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 17:18:14,370 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 17:18:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:14,371 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 17:18:14,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 17:18:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 17:18:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 17:18:14,377 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:14,379 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:14,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 17:18:14,380 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 17:18:14,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:14,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282705551] [2020-08-21 17:18:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-21 17:18:14,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282705551] [2020-08-21 17:18:14,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:14,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 17:18:14,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780632786] [2020-08-21 17:18:14,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 17:18:14,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:14,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 17:18:14,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 17:18:14,519 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 17:18:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:14,640 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 17:18:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 17:18:14,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 17:18:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:14,643 INFO L225 Difference]: With dead ends: 62 [2020-08-21 17:18:14,643 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 17:18:14,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:18:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 17:18:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 17:18:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 17:18:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 17:18:14,658 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 17:18:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:14,658 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 17:18:14,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 17:18:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 17:18:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 17:18:14,663 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:14,663 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:14,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 17:18:14,663 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 17:18:14,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:14,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428075293] [2020-08-21 17:18:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-21 17:18:14,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428075293] [2020-08-21 17:18:14,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:14,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 17:18:14,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851704365] [2020-08-21 17:18:14,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 17:18:14,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 17:18:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 17:18:14,964 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 17:18:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:15,131 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 17:18:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 17:18:15,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 17:18:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:15,136 INFO L225 Difference]: With dead ends: 97 [2020-08-21 17:18:15,136 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 17:18:15,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-21 17:18:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 17:18:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 17:18:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 17:18:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 17:18:15,157 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 17:18:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:15,158 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 17:18:15,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 17:18:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 17:18:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 17:18:15,162 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:15,162 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:15,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 17:18:15,163 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 17:18:15,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:15,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684024423] [2020-08-21 17:18:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-21 17:18:15,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684024423] [2020-08-21 17:18:15,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:15,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 17:18:15,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487596593] [2020-08-21 17:18:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 17:18:15,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 17:18:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 17:18:15,542 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 17:18:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:15,951 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 17:18:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 17:18:15,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 17:18:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:15,957 INFO L225 Difference]: With dead ends: 153 [2020-08-21 17:18:15,957 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 17:18:15,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-21 17:18:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 17:18:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 17:18:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 17:18:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 17:18:15,987 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 17:18:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:15,988 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 17:18:15,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 17:18:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 17:18:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 17:18:15,990 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:15,991 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:15,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 17:18:15,991 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 17:18:15,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:15,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291847875] [2020-08-21 17:18:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-21 17:18:16,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291847875] [2020-08-21 17:18:16,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 17:18:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430233753] [2020-08-21 17:18:16,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 17:18:16,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 17:18:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 17:18:16,217 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 17:18:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:16,388 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 17:18:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 17:18:16,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 17:18:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:16,390 INFO L225 Difference]: With dead ends: 68 [2020-08-21 17:18:16,390 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 17:18:16,391 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 17:18:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 17:18:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 17:18:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 17:18:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 17:18:16,400 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 17:18:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:16,401 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 17:18:16,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 17:18:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 17:18:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 17:18:16,403 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:16,403 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:16,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 17:18:16,404 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 17:18:16,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:16,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [651062546] [2020-08-21 17:18:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-21 17:18:16,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [651062546] [2020-08-21 17:18:16,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:16,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 17:18:16,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047447063] [2020-08-21 17:18:16,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 17:18:16,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:16,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 17:18:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 17:18:16,762 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 17:18:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:16,964 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 17:18:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 17:18:16,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 17:18:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:16,968 INFO L225 Difference]: With dead ends: 180 [2020-08-21 17:18:16,968 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 17:18:16,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-21 17:18:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 17:18:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 17:18:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 17:18:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 17:18:16,998 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 17:18:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:16,999 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 17:18:16,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 17:18:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 17:18:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 17:18:17,003 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:17,003 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:17,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 17:18:17,004 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 17:18:17,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:17,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4198604] [2020-08-21 17:18:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-21 17:18:17,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4198604] [2020-08-21 17:18:17,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:17,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 17:18:17,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559239692] [2020-08-21 17:18:17,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 17:18:17,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 17:18:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 17:18:17,876 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 17:18:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:18,166 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 17:18:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 17:18:18,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 17:18:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:18,173 INFO L225 Difference]: With dead ends: 410 [2020-08-21 17:18:18,173 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 17:18:18,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-21 17:18:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 17:18:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 17:18:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 17:18:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 17:18:18,230 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 17:18:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:18,231 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 17:18:18,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 17:18:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 17:18:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-21 17:18:18,245 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:18,245 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-21 17:18:18,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 17:18:18,245 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-21 17:18:18,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:18,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1540692314] [2020-08-21 17:18:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:18,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 17:18:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:18,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 17:18:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:18,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:18,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:18,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 17:18:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 17:18:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 17:18:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 17:18:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 17:18:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 17:18:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 17:18:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:19,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 17:18:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 17:18:20,291 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-21 17:18:20,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1540692314] [2020-08-21 17:18:20,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 17:18:20,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-21 17:18:20,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339014488] [2020-08-21 17:18:20,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-21 17:18:20,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 17:18:20,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-21 17:18:20,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-21 17:18:20,294 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-21 17:18:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 17:18:21,206 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-21 17:18:21,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-21 17:18:21,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-21 17:18:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 17:18:21,213 INFO L225 Difference]: With dead ends: 531 [2020-08-21 17:18:21,214 INFO L226 Difference]: Without dead ends: 148 [2020-08-21 17:18:21,218 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-21 17:18:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-21 17:18:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-21 17:18:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-21 17:18:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-21 17:18:21,230 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-21 17:18:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 17:18:21,231 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-21 17:18:21,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-21 17:18:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-21 17:18:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 17:18:21,241 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 17:18:21,241 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 17:18:21,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 17:18:21,242 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 17:18:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 17:18:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-21 17:18:21,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 17:18:21,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1501449345] [2020-08-21 17:18:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 17:18:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 17:18:21,343 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 17:18:21,343 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 17:18:21,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 17:18:21,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:18:21 BoogieIcfgContainer [2020-08-21 17:18:21,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 17:18:21,441 INFO L168 Benchmark]: Toolchain (without parser) took 9664.41 ms. Allocated memory was 147.3 MB in the beginning and 511.7 MB in the end (delta: 364.4 MB). Free memory was 103.5 MB in the beginning and 333.7 MB in the end (delta: -230.2 MB). Peak memory consumption was 134.2 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:21,443 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 17:18:21,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.34 ms. Allocated memory is still 147.3 MB. Free memory was 103.1 MB in the beginning and 93.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:21,444 INFO L168 Benchmark]: Boogie Preprocessor took 30.15 ms. Allocated memory is still 147.3 MB. Free memory was 93.8 MB in the beginning and 92.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:21,445 INFO L168 Benchmark]: RCFGBuilder took 344.99 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 92.5 MB in the beginning and 170.0 MB in the end (delta: -77.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:21,451 INFO L168 Benchmark]: TraceAbstraction took 9032.48 ms. Allocated memory was 202.4 MB in the beginning and 511.7 MB in the end (delta: 309.3 MB). Free memory was 169.3 MB in the beginning and 333.7 MB in the end (delta: -164.4 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. [2020-08-21 17:18:21,459 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 252.34 ms. Allocated memory is still 147.3 MB. Free memory was 103.1 MB in the beginning and 93.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.15 ms. Allocated memory is still 147.3 MB. Free memory was 93.8 MB in the beginning and 92.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.99 ms. Allocated memory was 147.3 MB in the beginning and 202.4 MB in the end (delta: 55.1 MB). Free memory was 92.5 MB in the beginning and 170.0 MB in the end (delta: -77.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9032.48 ms. Allocated memory was 202.4 MB in the beginning and 511.7 MB in the end (delta: 309.3 MB). Free memory was 169.3 MB in the beginning and 333.7 MB in the end (delta: -164.4 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.8s, 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, 1362 SolverSat, 476 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.7s 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.5s 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...