/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=1.0 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 02:43:54,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 02:43:54,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 02:43:54,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 02:43:54,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 02:43:54,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 02:43:54,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 02:43:54,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 02:43:54,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 02:43:54,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 02:43:54,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 02:43:54,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 02:43:54,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 02:43:54,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 02:43:54,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 02:43:54,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 02:43:54,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 02:43:54,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 02:43:54,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 02:43:54,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 02:43:54,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 02:43:54,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 02:43:54,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 02:43:54,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 02:43:54,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 02:43:54,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 02:43:54,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 02:43:54,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 02:43:54,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 02:43:54,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 02:43:54,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 02:43:54,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 02:43:54,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 02:43:54,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 02:43:54,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 02:43:54,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 02:43:54,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 02:43:54,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 02:43:54,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 02:43:54,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 02:43:54,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 02:43:54,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 02:43:54,461 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 02:43:54,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 02:43:54,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 02:43:54,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 02:43:54,464 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 02:43:54,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 02:43:54,465 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 02:43:54,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 02:43:54,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 02:43:54,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 02:43:54,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 02:43:54,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 02:43:54,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 02:43:54,467 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 02:43:54,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 02:43:54,467 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 02:43:54,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 02:43:54,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 02:43:54,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 02:43:54,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 02:43:54,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 02:43:54,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 02:43:54,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 02:43:54,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 02:43:54,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 02:43:54,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 02:43:54,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 02:43:54,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 02:43:54,470 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 02:43:54,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0; [2020-08-19 02:43:54,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 02:43:54,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 02:43:54,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 02:43:54,811 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 02:43:54,812 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 02:43:54,812 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 02:43:54,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bbddcf7c1/fbbd231941204a8db54da3207a30faee/FLAG9fe6478bf [2020-08-19 02:43:55,320 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 02:43:55,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 02:43:55,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bbddcf7c1/fbbd231941204a8db54da3207a30faee/FLAG9fe6478bf [2020-08-19 02:43:55,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bbddcf7c1/fbbd231941204a8db54da3207a30faee [2020-08-19 02:43:55,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 02:43:55,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 02:43:55,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 02:43:55,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 02:43:55,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 02:43:55,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 02:43:55" (1/1) ... [2020-08-19 02:43:55,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3eedfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:55, skipping insertion in model container [2020-08-19 02:43:55,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 02:43:55" (1/1) ... [2020-08-19 02:43:55,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 02:43:55,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 02:43:55,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 02:43:55,994 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 02:43:56,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 02:43:56,027 INFO L208 MainTranslator]: Completed translation [2020-08-19 02:43:56,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56 WrapperNode [2020-08-19 02:43:56,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 02:43:56,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 02:43:56,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 02:43:56,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 02:43:56,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... [2020-08-19 02:43:56,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 02:43:56,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 02:43:56,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 02:43:56,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 02:43:56,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 02:43:56,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 02:43:56,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 02:43:56,219 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 02:43:56,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 02:43:56,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 02:43:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 02:43:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 02:43:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 02:43:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 02:43:56,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 02:43:56,403 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 02:43:56,403 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 02:43:56,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 02:43:56 BoogieIcfgContainer [2020-08-19 02:43:56,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 02:43:56,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 02:43:56,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 02:43:56,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 02:43:56,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 02:43:55" (1/3) ... [2020-08-19 02:43:56,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a00d2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 02:43:56, skipping insertion in model container [2020-08-19 02:43:56,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 02:43:56" (2/3) ... [2020-08-19 02:43:56,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a00d2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 02:43:56, skipping insertion in model container [2020-08-19 02:43:56,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 02:43:56" (3/3) ... [2020-08-19 02:43:56,416 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 02:43:56,427 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 02:43:56,434 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 02:43:56,452 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 02:43:56,478 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 02:43:56,478 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 02:43:56,479 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 02:43:56,479 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 02:43:56,479 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 02:43:56,480 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 02:43:56,480 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 02:43:56,480 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 02:43:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 02:43:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 02:43:56,513 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:56,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:56,515 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 02:43:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:56,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1115429964] [2020-08-19 02:43:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:56,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:56,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 02:43:56,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1115429964] [2020-08-19 02:43:56,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 02:43:56,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 02:43:56,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842399718] [2020-08-19 02:43:56,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 02:43:56,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 02:43:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 02:43:56,777 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 02:43:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:56,891 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 02:43:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 02:43:56,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 02:43:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:56,906 INFO L225 Difference]: With dead ends: 35 [2020-08-19 02:43:56,906 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 02:43:56,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 02:43:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 02:43:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 02:43:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 02:43:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 02:43:56,992 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 02:43:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:56,995 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 02:43:56,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 02:43:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 02:43:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 02:43:56,997 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:56,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:56,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 02:43:56,999 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 02:43:57,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:57,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626021658] [2020-08-19 02:43:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 02:43:57,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626021658] [2020-08-19 02:43:57,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 02:43:57,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 02:43:57,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189301088] [2020-08-19 02:43:57,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 02:43:57,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 02:43:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 02:43:57,085 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 02:43:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:57,149 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 02:43:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 02:43:57,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 02:43:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:57,151 INFO L225 Difference]: With dead ends: 27 [2020-08-19 02:43:57,151 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 02:43:57,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 02:43:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 02:43:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 02:43:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 02:43:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 02:43:57,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 02:43:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:57,162 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 02:43:57,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 02:43:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 02:43:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 02:43:57,164 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:57,164 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:57,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 02:43:57,165 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 02:43:57,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:57,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591453489] [2020-08-19 02:43:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 02:43:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-19 02:43:57,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591453489] [2020-08-19 02:43:57,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:57,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 02:43:57,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256254777] [2020-08-19 02:43:57,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 02:43:57,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 02:43:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 02:43:57,337 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 02:43:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:57,423 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 02:43:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 02:43:57,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 02:43:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:57,425 INFO L225 Difference]: With dead ends: 38 [2020-08-19 02:43:57,425 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 02:43:57,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-19 02:43:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 02:43:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 02:43:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 02:43:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 02:43:57,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 02:43:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:57,435 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 02:43:57,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 02:43:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 02:43:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 02:43:57,436 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:57,437 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:57,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 02:43:57,437 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 02:43:57,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:57,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468257338] [2020-08-19 02:43:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 02:43:57,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468257338] [2020-08-19 02:43:57,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:57,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 02:43:57,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120071883] [2020-08-19 02:43:57,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 02:43:57,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 02:43:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 02:43:57,571 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 02:43:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:57,693 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 02:43:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 02:43:57,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 02:43:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:57,696 INFO L225 Difference]: With dead ends: 41 [2020-08-19 02:43:57,696 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 02:43:57,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 02:43:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 02:43:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 02:43:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 02:43:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 02:43:57,709 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 02:43:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:57,709 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 02:43:57,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 02:43:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 02:43:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 02:43:57,712 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:57,712 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:57,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 02:43:57,712 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 02:43:57,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:57,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749498582] [2020-08-19 02:43:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-19 02:43:57,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749498582] [2020-08-19 02:43:57,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:57,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 02:43:57,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834602884] [2020-08-19 02:43:57,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 02:43:57,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:57,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 02:43:57,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 02:43:57,872 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 02:43:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:57,993 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 02:43:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 02:43:57,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 02:43:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:57,996 INFO L225 Difference]: With dead ends: 76 [2020-08-19 02:43:57,996 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 02:43:57,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-19 02:43:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 02:43:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 02:43:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 02:43:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 02:43:58,009 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 02:43:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:58,010 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 02:43:58,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 02:43:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 02:43:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 02:43:58,012 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:58,012 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:58,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 02:43:58,013 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 02:43:58,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:58,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [553974943] [2020-08-19 02:43:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-19 02:43:58,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [553974943] [2020-08-19 02:43:58,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:58,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 02:43:58,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399232540] [2020-08-19 02:43:58,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 02:43:58,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:58,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 02:43:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 02:43:58,135 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 02:43:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:58,263 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 02:43:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 02:43:58,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 02:43:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:58,266 INFO L225 Difference]: With dead ends: 62 [2020-08-19 02:43:58,267 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 02:43:58,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 02:43:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 02:43:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 02:43:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 02:43:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 02:43:58,281 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 02:43:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:58,282 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 02:43:58,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 02:43:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 02:43:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 02:43:58,291 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:58,291 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:58,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 02:43:58,292 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 02:43:58,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:58,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434286735] [2020-08-19 02:43:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:43:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:43:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-19 02:43:58,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434286735] [2020-08-19 02:43:58,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:58,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 02:43:58,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216900139] [2020-08-19 02:43:58,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 02:43:58,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 02:43:58,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 02:43:58,620 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 02:43:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:58,774 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 02:43:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 02:43:58,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 02:43:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:58,779 INFO L225 Difference]: With dead ends: 97 [2020-08-19 02:43:58,779 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 02:43:58,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-19 02:43:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 02:43:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 02:43:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 02:43:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 02:43:58,802 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 02:43:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:58,803 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 02:43:58,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 02:43:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 02:43:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 02:43:58,806 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:58,806 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:58,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 02:43:58,807 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 02:43:58,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:58,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426281929] [2020-08-19 02:43:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:58,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:43:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:43:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:43:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:43:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-19 02:43:59,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426281929] [2020-08-19 02:43:59,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:59,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 02:43:59,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794689171] [2020-08-19 02:43:59,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 02:43:59,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 02:43:59,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 02:43:59,221 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 02:43:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:43:59,644 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 02:43:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 02:43:59,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 02:43:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:43:59,646 INFO L225 Difference]: With dead ends: 153 [2020-08-19 02:43:59,646 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 02:43:59,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-19 02:43:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 02:43:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 02:43:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 02:43:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 02:43:59,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 02:43:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:43:59,659 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 02:43:59,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 02:43:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 02:43:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 02:43:59,661 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:43:59,661 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:43:59,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 02:43:59,661 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:43:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:43:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 02:43:59,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:43:59,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [576611900] [2020-08-19 02:43:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:43:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:43:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:43:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:43:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:43:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:43:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:43:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:43:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:43:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-19 02:43:59,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [576611900] [2020-08-19 02:43:59,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:43:59,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 02:43:59,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453335078] [2020-08-19 02:43:59,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 02:43:59,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:43:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 02:43:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 02:43:59,871 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 02:44:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:44:00,036 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 02:44:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 02:44:00,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 02:44:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:44:00,037 INFO L225 Difference]: With dead ends: 68 [2020-08-19 02:44:00,038 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 02:44:00,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 02:44:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 02:44:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 02:44:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 02:44:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 02:44:00,046 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 02:44:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:44:00,047 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 02:44:00,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 02:44:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 02:44:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 02:44:00,049 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:44:00,049 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:44:00,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 02:44:00,049 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:44:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:44:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 02:44:00,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:44:00,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964996978] [2020-08-19 02:44:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:44:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:44:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:44:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:44:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 02:44:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-19 02:44:00,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964996978] [2020-08-19 02:44:00,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:44:00,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 02:44:00,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368556696] [2020-08-19 02:44:00,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 02:44:00,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:44:00,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 02:44:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 02:44:00,469 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 02:44:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:44:00,710 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 02:44:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 02:44:00,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 02:44:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:44:00,713 INFO L225 Difference]: With dead ends: 180 [2020-08-19 02:44:00,714 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 02:44:00,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 02:44:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 02:44:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 02:44:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 02:44:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 02:44:00,745 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 02:44:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:44:00,746 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 02:44:00,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 02:44:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 02:44:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 02:44:00,754 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:44:00,754 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:44:00,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 02:44:00,756 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:44:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:44:00,757 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 02:44:00,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:44:00,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236907897] [2020-08-19 02:44:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:44:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:44:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:44:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:44:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 02:44:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 02:44:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:44:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-19 02:44:01,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236907897] [2020-08-19 02:44:01,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:44:01,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 02:44:01,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588625002] [2020-08-19 02:44:01,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 02:44:01,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:44:01,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 02:44:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 02:44:01,757 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 02:44:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:44:02,059 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 02:44:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 02:44:02,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 02:44:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:44:02,066 INFO L225 Difference]: With dead ends: 410 [2020-08-19 02:44:02,066 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 02:44:02,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-19 02:44:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 02:44:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 02:44:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 02:44:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 02:44:02,137 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 02:44:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:44:02,139 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 02:44:02,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 02:44:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 02:44:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-19 02:44:02,155 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:44:02,156 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:44:02,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 02:44:02,156 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:44:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:44:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-19 02:44:02,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:44:02,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057127401] [2020-08-19 02:44:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:44:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 02:44:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 02:44:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:02,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:44:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 02:44:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 02:44:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:44:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 02:44:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 02:44:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 02:44:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 02:44:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 02:44:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 02:44:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 02:44:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:03,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 02:44:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 02:44:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-19 02:44:04,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057127401] [2020-08-19 02:44:04,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 02:44:04,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 02:44:04,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426458059] [2020-08-19 02:44:04,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 02:44:04,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 02:44:04,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 02:44:04,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-19 02:44:04,203 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-19 02:44:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 02:44:05,198 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-19 02:44:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-19 02:44:05,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-19 02:44:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 02:44:05,201 INFO L225 Difference]: With dead ends: 531 [2020-08-19 02:44:05,202 INFO L226 Difference]: Without dead ends: 148 [2020-08-19 02:44:05,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-19 02:44:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-19 02:44:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-19 02:44:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-19 02:44:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-19 02:44:05,216 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-19 02:44:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 02:44:05,217 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-19 02:44:05,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 02:44:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-19 02:44:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 02:44:05,225 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 02:44:05,226 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 02:44:05,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 02:44:05,226 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 02:44:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 02:44:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-19 02:44:05,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 02:44:05,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186701631] [2020-08-19 02:44:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 02:44:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 02:44:05,391 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 02:44:05,392 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 02:44:05,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 02:44:05,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 02:44:05 BoogieIcfgContainer [2020-08-19 02:44:05,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 02:44:05,456 INFO L168 Benchmark]: Toolchain (without parser) took 9750.37 ms. Allocated memory was 147.8 MB in the beginning and 512.8 MB in the end (delta: 364.9 MB). Free memory was 103.6 MB in the beginning and 351.6 MB in the end (delta: -248.0 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2020-08-19 02:44:05,457 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 02:44:05,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.18 ms. Allocated memory is still 147.8 MB. Free memory was 103.4 MB in the beginning and 94.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-19 02:44:05,459 INFO L168 Benchmark]: Boogie Preprocessor took 122.66 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 94.1 MB in the beginning and 182.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-08-19 02:44:05,459 INFO L168 Benchmark]: RCFGBuilder took 255.52 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 170.0 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-08-19 02:44:05,460 INFO L168 Benchmark]: TraceAbstraction took 9044.36 ms. Allocated memory was 203.4 MB in the beginning and 512.8 MB in the end (delta: 309.3 MB). Free memory was 169.4 MB in the beginning and 351.6 MB in the end (delta: -182.2 MB). Peak memory consumption was 127.1 MB. Max. memory is 7.1 GB. [2020-08-19 02:44:05,464 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.18 ms. Allocated memory is still 147.8 MB. Free memory was 103.4 MB in the beginning and 94.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.66 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 94.1 MB in the beginning and 182.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.52 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 170.0 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9044.36 ms. Allocated memory was 203.4 MB in the beginning and 512.8 MB in the end (delta: 309.3 MB). Free memory was 169.4 MB in the beginning and 351.6 MB in the end (delta: -182.2 MB). Peak memory consumption was 127.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.9s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1350 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.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.5s SatisfiabilityAnalysisTime, 4.4s 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...