/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=WIDEST -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-18 22:41:05,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 22:41:05,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 22:41:05,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 22:41:05,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 22:41:05,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 22:41:05,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 22:41:05,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 22:41:05,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 22:41:05,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 22:41:05,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 22:41:05,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 22:41:05,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 22:41:05,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 22:41:05,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 22:41:05,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 22:41:05,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 22:41:05,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 22:41:05,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 22:41:05,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 22:41:05,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 22:41:05,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 22:41:05,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 22:41:05,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 22:41:05,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 22:41:05,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 22:41:05,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 22:41:05,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 22:41:05,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 22:41:05,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 22:41:05,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 22:41:05,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 22:41:05,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 22:41:05,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 22:41:05,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 22:41:05,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 22:41:05,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 22:41:05,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 22:41:05,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 22:41:05,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 22:41:05,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 22:41:05,427 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-18 22:41:05,465 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 22:41:05,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 22:41:05,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 22:41:05,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 22:41:05,468 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 22:41:05,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 22:41:05,469 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 22:41:05,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 22:41:05,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 22:41:05,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 22:41:05,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 22:41:05,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 22:41:05,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 22:41:05,471 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 22:41:05,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 22:41:05,472 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 22:41:05,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 22:41:05,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 22:41:05,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 22:41:05,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 22:41:05,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 22:41:05,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 22:41:05,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 22:41:05,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 22:41:05,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 22:41:05,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 22:41:05,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 22:41:05,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 22:41:05,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 22:41:05,474 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=WIDEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDEST; [2020-08-18 22:41:05,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 22:41:05,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 22:41:05,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 22:41:05,809 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 22:41:05,809 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 22:41:05,810 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-18 22:41:05,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4b525bf1/a3c04dbe12aa45f780d0589f61e3807e/FLAGcd2d46d4f [2020-08-18 22:41:06,336 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 22:41:06,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 22:41:06,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4b525bf1/a3c04dbe12aa45f780d0589f61e3807e/FLAGcd2d46d4f [2020-08-18 22:41:06,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4b525bf1/a3c04dbe12aa45f780d0589f61e3807e [2020-08-18 22:41:06,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 22:41:06,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 22:41:06,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 22:41:06,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 22:41:06,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 22:41:06,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee4d01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06, skipping insertion in model container [2020-08-18 22:41:06,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 22:41:06,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 22:41:06,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 22:41:06,943 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 22:41:06,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 22:41:06,973 INFO L208 MainTranslator]: Completed translation [2020-08-18 22:41:06,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06 WrapperNode [2020-08-18 22:41:06,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 22:41:06,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 22:41:06,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 22:41:06,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 22:41:06,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:06,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:07,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (1/1) ... [2020-08-18 22:41:07,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 22:41:07,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 22:41:07,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 22:41:07,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 22:41:07,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (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-18 22:41:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 22:41:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 22:41:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 22:41:07,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 22:41:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 22:41:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 22:41:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 22:41:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 22:41:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 22:41:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 22:41:07,330 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 22:41:07,331 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 22:41:07,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 10:41:07 BoogieIcfgContainer [2020-08-18 22:41:07,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 22:41:07,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 22:41:07,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 22:41:07,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 22:41:07,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 10:41:06" (1/3) ... [2020-08-18 22:41:07,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae288b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 10:41:07, skipping insertion in model container [2020-08-18 22:41:07,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 10:41:06" (2/3) ... [2020-08-18 22:41:07,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae288b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 10:41:07, skipping insertion in model container [2020-08-18 22:41:07,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 10:41:07" (3/3) ... [2020-08-18 22:41:07,343 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 22:41:07,353 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 22:41:07,360 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 22:41:07,374 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 22:41:07,398 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 22:41:07,398 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 22:41:07,398 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 22:41:07,398 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 22:41:07,399 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 22:41:07,399 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 22:41:07,399 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 22:41:07,399 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 22:41:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 22:41:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 22:41:07,424 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:07,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:07,425 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 22:41:07,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:07,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044108276] [2020-08-18 22:41:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:07,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:07,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:07,659 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-18 22:41:07,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044108276] [2020-08-18 22:41:07,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 22:41:07,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 22:41:07,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876149819] [2020-08-18 22:41:07,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 22:41:07,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 22:41:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 22:41:07,702 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 22:41:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:07,838 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 22:41:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 22:41:07,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 22:41:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:07,850 INFO L225 Difference]: With dead ends: 35 [2020-08-18 22:41:07,851 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 22:41:07,854 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-18 22:41:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 22:41:07,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 22:41:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 22:41:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 22:41:07,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 22:41:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:07,900 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 22:41:07,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 22:41:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 22:41:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 22:41:07,903 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:07,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 22:41:07,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 22:41:07,904 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 22:41:07,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:07,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1969931608] [2020-08-18 22:41:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:07,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:07,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:07,983 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-18 22:41:07,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1969931608] [2020-08-18 22:41:07,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 22:41:07,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 22:41:07,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237156806] [2020-08-18 22:41:07,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 22:41:07,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:07,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 22:41:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 22:41:07,988 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 22:41:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:08,054 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 22:41:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 22:41:08,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 22:41:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:08,057 INFO L225 Difference]: With dead ends: 27 [2020-08-18 22:41:08,057 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 22:41:08,059 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-18 22:41:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 22:41:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 22:41:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 22:41:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 22:41:08,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 22:41:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:08,068 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 22:41:08,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 22:41:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 22:41:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 22:41:08,070 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:08,070 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-18 22:41:08,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 22:41:08,071 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 22:41:08,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:08,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538207914] [2020-08-18 22:41:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 22:41:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,248 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-18 22:41:08,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538207914] [2020-08-18 22:41:08,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:08,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 22:41:08,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323685554] [2020-08-18 22:41:08,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 22:41:08,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:08,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 22:41:08,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 22:41:08,251 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 22:41:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:08,337 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 22:41:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 22:41:08,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 22:41:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:08,340 INFO L225 Difference]: With dead ends: 38 [2020-08-18 22:41:08,340 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 22:41:08,341 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-18 22:41:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 22:41:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 22:41:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 22:41:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 22:41:08,349 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 22:41:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:08,350 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 22:41:08,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 22:41:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 22:41:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 22:41:08,352 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:08,352 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-18 22:41:08,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 22:41:08,353 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 22:41:08,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:08,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [503223767] [2020-08-18 22:41:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,460 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-18 22:41:08,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [503223767] [2020-08-18 22:41:08,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:08,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 22:41:08,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477894789] [2020-08-18 22:41:08,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 22:41:08,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 22:41:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 22:41:08,463 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 22:41:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:08,587 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 22:41:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 22:41:08,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 22:41:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:08,590 INFO L225 Difference]: With dead ends: 41 [2020-08-18 22:41:08,591 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 22:41:08,592 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-18 22:41:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 22:41:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 22:41:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 22:41:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 22:41:08,604 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 22:41:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:08,604 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 22:41:08,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 22:41:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 22:41:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 22:41:08,606 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:08,607 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-18 22:41:08,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 22:41:08,607 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 22:41:08,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:08,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877504675] [2020-08-18 22:41:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:08,787 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-18 22:41:08,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877504675] [2020-08-18 22:41:08,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:08,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 22:41:08,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44527948] [2020-08-18 22:41:08,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 22:41:08,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 22:41:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 22:41:08,790 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 22:41:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:08,956 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 22:41:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 22:41:08,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 22:41:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:08,961 INFO L225 Difference]: With dead ends: 76 [2020-08-18 22:41:08,962 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 22:41:08,965 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-18 22:41:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 22:41:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 22:41:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 22:41:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 22:41:08,991 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 22:41:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:08,992 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 22:41:08,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 22:41:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 22:41:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 22:41:08,997 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:08,997 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-18 22:41:08,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 22:41:09,000 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:09,001 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 22:41:09,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:09,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007463195] [2020-08-18 22:41:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,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-18 22:41:09,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007463195] [2020-08-18 22:41:09,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:09,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 22:41:09,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491437893] [2020-08-18 22:41:09,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 22:41:09,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 22:41:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 22:41:09,134 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 22:41:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:09,248 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 22:41:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 22:41:09,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 22:41:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:09,251 INFO L225 Difference]: With dead ends: 62 [2020-08-18 22:41:09,251 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 22:41:09,252 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-18 22:41:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 22:41:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 22:41:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 22:41:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 22:41:09,267 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 22:41:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:09,267 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 22:41:09,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 22:41:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 22:41:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 22:41:09,272 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:09,272 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-18 22:41:09,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 22:41:09,273 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:09,274 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 22:41:09,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:09,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210861063] [2020-08-18 22:41:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,539 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-18 22:41:09,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210861063] [2020-08-18 22:41:09,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:09,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 22:41:09,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931290413] [2020-08-18 22:41:09,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 22:41:09,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 22:41:09,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 22:41:09,546 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 22:41:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:09,731 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 22:41:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 22:41:09,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 22:41:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:09,738 INFO L225 Difference]: With dead ends: 97 [2020-08-18 22:41:09,740 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 22:41:09,743 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-18 22:41:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 22:41:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 22:41:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 22:41:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 22:41:09,782 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 22:41:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:09,784 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 22:41:09,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 22:41:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 22:41:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 22:41:09,788 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:09,788 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-18 22:41:09,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 22:41:09,789 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 22:41:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:09,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1690164626] [2020-08-18 22:41:09,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:09,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,181 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-18 22:41:10,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1690164626] [2020-08-18 22:41:10,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:10,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 22:41:10,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700659221] [2020-08-18 22:41:10,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 22:41:10,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:10,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 22:41:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 22:41:10,185 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 22:41:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:10,619 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 22:41:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 22:41:10,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 22:41:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:10,623 INFO L225 Difference]: With dead ends: 153 [2020-08-18 22:41:10,623 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 22:41:10,626 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-18 22:41:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 22:41:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 22:41:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 22:41:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 22:41:10,638 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 22:41:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:10,638 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 22:41:10,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 22:41:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 22:41:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 22:41:10,641 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:10,641 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-18 22:41:10,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 22:41:10,641 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:10,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 22:41:10,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:10,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1406707821] [2020-08-18 22:41:10,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:10,877 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-18 22:41:10,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1406707821] [2020-08-18 22:41:10,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:10,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 22:41:10,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355535576] [2020-08-18 22:41:10,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 22:41:10,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:10,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 22:41:10,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 22:41:10,880 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 22:41:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:11,030 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 22:41:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 22:41:11,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 22:41:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:11,032 INFO L225 Difference]: With dead ends: 68 [2020-08-18 22:41:11,032 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 22:41:11,033 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-18 22:41:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 22:41:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 22:41:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 22:41:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 22:41:11,042 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 22:41:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:11,043 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 22:41:11,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 22:41:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 22:41:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 22:41:11,045 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:11,045 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-18 22:41:11,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 22:41:11,046 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 22:41:11,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:11,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801395630] [2020-08-18 22:41:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,444 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-18 22:41:11,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801395630] [2020-08-18 22:41:11,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:11,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 22:41:11,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294496620] [2020-08-18 22:41:11,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 22:41:11,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 22:41:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 22:41:11,447 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 22:41:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:11,679 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 22:41:11,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 22:41:11,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 22:41:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:11,685 INFO L225 Difference]: With dead ends: 180 [2020-08-18 22:41:11,685 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 22:41:11,686 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-18 22:41:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 22:41:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 22:41:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 22:41:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 22:41:11,728 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 22:41:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:11,731 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 22:41:11,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 22:41:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 22:41:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 22:41:11,738 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:11,739 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-18 22:41:11,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 22:41:11,739 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 22:41:11,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:11,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438603408] [2020-08-18 22:41:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:11,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:12,619 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-18 22:41:12,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438603408] [2020-08-18 22:41:12,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:12,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 22:41:12,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557436885] [2020-08-18 22:41:12,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 22:41:12,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:12,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 22:41:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 22:41:12,622 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 22:41:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:12,926 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 22:41:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 22:41:12,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 22:41:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:12,932 INFO L225 Difference]: With dead ends: 410 [2020-08-18 22:41:12,933 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 22:41:12,934 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-18 22:41:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 22:41:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 22:41:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 22:41:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 22:41:12,972 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 22:41:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:12,973 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 22:41:12,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 22:41:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 22:41:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-18 22:41:12,986 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:12,987 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-18 22:41:12,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 22:41:12,987 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:12,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-18 22:41:12,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:12,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207817081] [2020-08-18 22:41:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 22:41:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 22:41:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:13,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 22:41:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 22:41:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 22:41:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 22:41:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 22:41:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 22:41:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 22:41:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 22:41:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 22:41:14,989 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-18 22:41:14,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207817081] [2020-08-18 22:41:14,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 22:41:14,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-18 22:41:14,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151270867] [2020-08-18 22:41:14,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-18 22:41:14,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 22:41:14,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-18 22:41:14,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-18 22:41:14,992 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-18 22:41:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 22:41:15,975 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-18 22:41:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-18 22:41:15,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-18 22:41:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 22:41:15,985 INFO L225 Difference]: With dead ends: 531 [2020-08-18 22:41:15,985 INFO L226 Difference]: Without dead ends: 148 [2020-08-18 22:41:15,991 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-18 22:41:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-18 22:41:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-18 22:41:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-18 22:41:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-18 22:41:16,004 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-18 22:41:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 22:41:16,006 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-18 22:41:16,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-18 22:41:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-18 22:41:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 22:41:16,016 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 22:41:16,017 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-18 22:41:16,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 22:41:16,017 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 22:41:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 22:41:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-18 22:41:16,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 22:41:16,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728417576] [2020-08-18 22:41:16,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 22:41:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 22:41:16,155 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 22:41:16,155 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 22:41:16,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 22:41:16,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 10:41:16 BoogieIcfgContainer [2020-08-18 22:41:16,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 22:41:16,210 INFO L168 Benchmark]: Toolchain (without parser) took 9487.26 ms. Allocated memory was 138.9 MB in the beginning and 558.4 MB in the end (delta: 419.4 MB). Free memory was 100.8 MB in the beginning and 451.0 MB in the end (delta: -350.2 MB). Peak memory consumption was 432.8 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:16,210 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-18 22:41:16,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.03 ms. Allocated memory is still 138.9 MB. Free memory was 100.6 MB in the beginning and 91.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:16,212 INFO L168 Benchmark]: Boogie Preprocessor took 26.62 ms. Allocated memory is still 138.9 MB. Free memory was 91.4 MB in the beginning and 90.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:16,213 INFO L168 Benchmark]: RCFGBuilder took 333.29 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 170.1 MB in the end (delta: -80.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:16,213 INFO L168 Benchmark]: TraceAbstraction took 8870.80 ms. Allocated memory was 202.4 MB in the beginning and 558.4 MB in the end (delta: 356.0 MB). Free memory was 169.4 MB in the beginning and 451.0 MB in the end (delta: -281.6 MB). Peak memory consumption was 437.9 MB. Max. memory is 7.1 GB. [2020-08-18 22:41:16,216 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.03 ms. Allocated memory is still 138.9 MB. Free memory was 100.6 MB in the beginning and 91.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.62 ms. Allocated memory is still 138.9 MB. Free memory was 91.4 MB in the beginning and 90.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.29 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 170.1 MB in the end (delta: -80.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8870.80 ms. Allocated memory was 202.4 MB in the beginning and 558.4 MB in the end (delta: 356.0 MB). Free memory was 169.4 MB in the beginning and 451.0 MB in the end (delta: -281.6 MB). Peak memory consumption was 437.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.7s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1346 SolverSat, 481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...